TSTP Solution File: REL027+4 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : REL027+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 19:21:13 EDT 2022

% Result   : Theorem 2.57s 0.74s
% Output   : CNFRefutation 2.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : REL027+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jul  8 09:05:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.12/0.37  # and selection function SelectNewComplexAHP.
% 0.12/0.37  #
% 0.12/0.37  # Number of axioms: 17 Number of unprocessed: 17
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.12/0.37  # The folding up rule is enabled...
% 0.12/0.37  # Local unification is enabled...
% 0.12/0.37  # Any saturation attempts will use folding labels...
% 0.12/0.37  # 17 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 2 conjectures.
% 0.12/0.37  # There are 2 start rule candidates:
% 0.12/0.37  # Found 16 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 2 start rule tableaux created.
% 0.12/0.37  # 1 extension rule candidate clauses
% 0.12/0.37  # 16 unit axiom clauses
% 0.12/0.37  
% 0.12/0.37  # Requested 8, 32 cores available to the main process.
% 0.12/0.37  # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.37  # Creating equality axioms
% 0.12/0.37  # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37  # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37  # We now have 24 tableaux to operate on
% 2.57/0.74  # There were 1 total branch saturation attempts.
% 2.57/0.74  # There were 0 of these attempts blocked.
% 2.57/0.74  # There were 0 deferred branch saturation attempts.
% 2.57/0.74  # There were 0 free duplicated saturations.
% 2.57/0.74  # There were 1 total successful branch saturations.
% 2.57/0.74  # There were 0 successful branch saturations in interreduction.
% 2.57/0.74  # There were 0 successful branch saturations on the branch.
% 2.57/0.74  # There were 1 successful branch saturations after the branch.
% 2.57/0.74  # There were 1 total branch saturation attempts.
% 2.57/0.74  # There were 0 of these attempts blocked.
% 2.57/0.74  # There were 0 deferred branch saturation attempts.
% 2.57/0.74  # There were 0 free duplicated saturations.
% 2.57/0.74  # There were 1 total successful branch saturations.
% 2.57/0.74  # There were 0 successful branch saturations in interreduction.
% 2.57/0.74  # There were 0 successful branch saturations on the branch.
% 2.57/0.74  # There were 1 successful branch saturations after the branch.
% 2.57/0.74  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/0.74  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/0.74  # Begin clausification derivation
% 2.57/0.74  
% 2.57/0.74  # End clausification derivation
% 2.57/0.74  # Begin listing active clauses obtained from FOF to CNF conversion
% 2.57/0.74  cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 2.57/0.74  cnf(i_0_18, negated_conjecture, (join(esk1_0,one)=one)).
% 2.57/0.74  cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 2.57/0.74  cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 2.57/0.74  cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 2.57/0.74  cnf(i_0_9, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))).
% 2.57/0.74  cnf(i_0_10, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))).
% 2.57/0.74  cnf(i_0_13, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)).
% 2.57/0.74  cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 2.57/0.74  cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 2.57/0.74  cnf(i_0_7, plain, (join(composition(X1,X3),composition(X2,X3))=composition(join(X1,X2),X3))).
% 2.57/0.74  cnf(i_0_11, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))).
% 2.57/0.74  cnf(i_0_3, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)).
% 2.57/0.74  cnf(i_0_17, negated_conjecture, (join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one))))!=complement(join(complement(complement(esk1_0)),complement(one)))|join(complement(join(complement(complement(esk1_0)),complement(one))),complement(join(complement(complement(composition(esk1_0,top))),complement(one))))!=complement(join(complement(complement(composition(esk1_0,top))),complement(one))))).
% 2.57/0.74  cnf(i_0_14, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))).
% 2.57/0.74  cnf(i_0_15, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))).
% 2.57/0.74  cnf(i_0_16, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))=complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))).
% 2.57/0.74  cnf(i_0_28, plain, (X39=X39)).
% 2.57/0.74  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 2.57/0.74  # Begin printing tableau
% 2.57/0.74  # Found 5 steps
% 2.57/0.74  cnf(i_0_8, plain, (converse(converse(X3))=X3), inference(start_rule)).
% 2.57/0.74  cnf(i_0_36, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_33])).
% 2.57/0.74  cnf(i_0_67, plain, (complement(converse(converse(X3)))=complement(X3)), inference(extension_rule, [i_0_31])).
% 2.57/0.74  cnf(i_0_82, plain, (complement(X3)!=converse(converse(complement(X3)))), inference(closure_rule, [i_0_8])).
% 2.57/0.74  cnf(i_0_80, plain, (complement(converse(converse(X3)))=converse(converse(complement(X3)))), inference(etableau_closure_rule, [i_0_80, ...])).
% 2.57/0.74  # End printing tableau
% 2.57/0.74  # SZS output end
% 2.57/0.74  # Branches closed with saturation will be marked with an "s"
% 2.57/0.74  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/0.74  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/0.74  # Begin clausification derivation
% 2.57/0.74  
% 2.57/0.74  # End clausification derivation
% 2.57/0.74  # Begin listing active clauses obtained from FOF to CNF conversion
% 2.57/0.74  cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 2.57/0.74  cnf(i_0_18, negated_conjecture, (join(esk1_0,one)=one)).
% 2.57/0.74  cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 2.57/0.74  cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 2.57/0.74  cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 2.57/0.74  cnf(i_0_9, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))).
% 2.57/0.74  cnf(i_0_10, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))).
% 2.57/0.74  cnf(i_0_13, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)).
% 2.57/0.74  cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 2.57/0.74  cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 2.57/0.74  cnf(i_0_7, plain, (join(composition(X1,X3),composition(X2,X3))=composition(join(X1,X2),X3))).
% 2.57/0.74  cnf(i_0_11, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))).
% 2.57/0.74  cnf(i_0_3, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)).
% 2.57/0.74  cnf(i_0_17, negated_conjecture, (join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one))))!=complement(join(complement(complement(esk1_0)),complement(one)))|join(complement(join(complement(complement(esk1_0)),complement(one))),complement(join(complement(complement(composition(esk1_0,top))),complement(one))))!=complement(join(complement(complement(composition(esk1_0,top))),complement(one))))).
% 2.57/0.74  cnf(i_0_14, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))).
% 2.57/0.74  cnf(i_0_15, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))).
% 2.57/0.74  cnf(i_0_16, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))=complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))).
% 2.57/0.74  cnf(i_0_28, plain, (X39=X39)).
% 2.57/0.74  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 2.57/0.74  # Begin printing tableau
% 2.57/0.74  # Found 6 steps
% 2.57/0.74  cnf(i_0_8, plain, (converse(converse(X5))=X5), inference(start_rule)).
% 2.57/0.74  cnf(i_0_36, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_34])).
% 2.57/0.74  cnf(i_0_70, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_8])).
% 2.57/0.74  cnf(i_0_69, plain, (composition(converse(converse(X3)),converse(converse(X5)))=composition(X3,X5)), inference(extension_rule, [i_0_31])).
% 2.57/0.74  cnf(i_0_82, plain, (composition(X3,X5)!=converse(converse(composition(X3,X5)))), inference(closure_rule, [i_0_8])).
% 2.57/0.74  cnf(i_0_80, plain, (composition(converse(converse(X3)),converse(converse(X5)))=converse(converse(composition(X3,X5)))), inference(etableau_closure_rule, [i_0_80, ...])).
% 2.57/0.74  # End printing tableau
% 2.57/0.74  # SZS output end
% 2.57/0.74  # Branches closed with saturation will be marked with an "s"
% 2.57/0.75  # Child (2286) has found a proof.
% 2.57/0.75  
% 2.57/0.75  # Proof search is over...
% 2.57/0.75  # Freeing feature tree
%------------------------------------------------------------------------------