%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : REL008+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 : n018.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:20:44 EDT 2022 % Result : Theorem 5.37s 1.12s % Output : CNFRefutation 5.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : REL008+4 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n018.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Fri Jul 8 11:17:55 EDT 2022 % 0.14/0.37 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.21/0.39 # and selection function SelectNewComplexAHP. % 0.21/0.39 # % 0.21/0.39 # Number of axioms: 16 Number of unprocessed: 16 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.40 # The folding up rule is enabled... % 0.21/0.40 # Local unification is enabled... % 0.21/0.40 # Any saturation attempts will use folding labels... % 0.21/0.40 # 16 beginning clauses after preprocessing and clausification % 0.21/0.40 # Creating start rules for all 1 conjectures. % 0.21/0.40 # There are 1 start rule candidates: % 0.21/0.40 # Found 15 unit axioms. % 0.21/0.40 # 1 start rule tableaux created. % 0.21/0.40 # 1 extension rule candidate clauses % 0.21/0.40 # 15 unit axiom clauses % 0.21/0.40 % 0.21/0.40 # Requested 8, 32 cores available to the main process. % 0.21/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.40 # Creating equality axioms % 0.21/0.40 # Ran out of tableaux, making start rules for all clauses % 0.21/0.40 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. % 0.21/0.40 # We now have 23 tableaux to operate on % 5.37/1.12 # There were 1 total branch saturation attempts. % 5.37/1.12 # There were 0 of these attempts blocked. % 5.37/1.12 # There were 0 deferred branch saturation attempts. % 5.37/1.12 # There were 0 free duplicated saturations. % 5.37/1.12 # There were 1 total successful branch saturations. % 5.37/1.12 # There were 0 successful branch saturations in interreduction. % 5.37/1.12 # There were 0 successful branch saturations on the branch. % 5.37/1.12 # There were 1 successful branch saturations after the branch. % 5.37/1.12 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.37/1.12 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.37/1.12 # Begin clausification derivation % 5.37/1.12 % 5.37/1.12 # End clausification derivation % 5.37/1.12 # Begin listing active clauses obtained from FOF to CNF conversion % 5.37/1.12 cnf(i_0_8, plain, (converse(converse(X1))=X1)). % 5.37/1.12 cnf(i_0_6, plain, (composition(X1,one)=X1)). % 5.37/1.12 cnf(i_0_12, plain, (join(X1,complement(X1))=top)). % 5.37/1.12 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))). % 5.37/1.12 cnf(i_0_9, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))). % 5.37/1.12 cnf(i_0_10, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))). % 5.37/1.12 cnf(i_0_13, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)). % 5.37/1.12 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 5.37/1.12 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). % 5.37/1.12 cnf(i_0_7, plain, (join(composition(X1,X3),composition(X2,X3))=composition(join(X1,X2),X3))). % 5.37/1.12 cnf(i_0_11, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))). % 5.37/1.12 cnf(i_0_3, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)). % 5.37/1.12 cnf(i_0_17, negated_conjecture, (join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0)))!=composition(esk1_0,join(esk2_0,esk3_0))|join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)))). % 5.37/1.12 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))))))). % 5.37/1.12 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))))). % 5.37/1.12 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))))). % 5.37/1.12 cnf(i_0_24, plain, (X41=X41)). % 5.37/1.12 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.37/1.12 # Begin printing tableau % 5.37/1.12 # Found 5 steps % 5.37/1.12 cnf(i_0_8, plain, (converse(converse(X3))=X3), inference(start_rule)). % 5.37/1.12 cnf(i_0_32, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_29])). % 5.37/1.12 cnf(i_0_62, plain, (complement(converse(converse(X3)))=complement(X3)), inference(extension_rule, [i_0_27])). % 5.37/1.12 cnf(i_0_77, plain, (complement(X3)!=converse(converse(complement(X3)))), inference(closure_rule, [i_0_8])). % 5.37/1.12 cnf(i_0_75, plain, (complement(converse(converse(X3)))=converse(converse(complement(X3)))), inference(etableau_closure_rule, [i_0_75, ...])). % 5.37/1.12 # End printing tableau % 5.37/1.12 # SZS output end % 5.37/1.12 # Branches closed with saturation will be marked with an "s" % 5.37/1.13 # There were 1 total branch saturation attempts. % 5.37/1.13 # There were 0 of these attempts blocked. % 5.37/1.13 # There were 0 deferred branch saturation attempts. % 5.37/1.13 # There were 0 free duplicated saturations. % 5.37/1.13 # There were 1 total successful branch saturations. % 5.37/1.13 # There were 0 successful branch saturations in interreduction. % 5.37/1.13 # There were 0 successful branch saturations on the branch. % 5.37/1.13 # There were 1 successful branch saturations after the branch. % 5.37/1.13 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.37/1.13 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.37/1.13 # Begin clausification derivation % 5.37/1.13 % 5.37/1.13 # End clausification derivation % 5.37/1.13 # Begin listing active clauses obtained from FOF to CNF conversion % 5.37/1.13 cnf(i_0_8, plain, (converse(converse(X1))=X1)). % 5.37/1.13 cnf(i_0_6, plain, (composition(X1,one)=X1)). % 5.37/1.13 cnf(i_0_12, plain, (join(X1,complement(X1))=top)). % 5.37/1.13 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))). % 5.37/1.13 cnf(i_0_9, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))). % 5.37/1.13 cnf(i_0_10, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))). % 5.37/1.13 cnf(i_0_13, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)). % 5.37/1.13 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 5.37/1.13 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). % 5.37/1.13 cnf(i_0_7, plain, (join(composition(X1,X3),composition(X2,X3))=composition(join(X1,X2),X3))). % 5.37/1.13 cnf(i_0_11, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))). % 5.37/1.13 cnf(i_0_3, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)). % 5.37/1.13 cnf(i_0_17, negated_conjecture, (join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0)))!=composition(esk1_0,join(esk2_0,esk3_0))|join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)))). % 5.37/1.13 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))))))). % 5.37/1.13 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))))). % 5.37/1.13 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))))). % 5.37/1.13 cnf(i_0_24, plain, (X41=X41)). % 5.37/1.13 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.37/1.13 # Begin printing tableau % 5.37/1.13 # Found 5 steps % 5.37/1.13 cnf(i_0_8, plain, (converse(converse(converse(X4)))=converse(X4)), inference(start_rule)). % 5.37/1.13 cnf(i_0_32, plain, (converse(converse(converse(X4)))=converse(X4)), inference(extension_rule, [i_0_31])). % 5.37/1.13 cnf(i_0_67, plain, (converse(converse(converse(converse(X4))))=converse(converse(X4))), inference(extension_rule, [i_0_27])). % 5.37/1.13 cnf(i_0_77, plain, (converse(converse(X4))!=X4), inference(closure_rule, [i_0_8])). % 5.37/1.13 cnf(i_0_75, plain, (converse(converse(converse(converse(X4))))=X4), inference(etableau_closure_rule, [i_0_75, ...])). % 5.37/1.13 # End printing tableau % 5.37/1.13 # SZS output end % 5.37/1.13 # Branches closed with saturation will be marked with an "s" % 5.91/1.13 # Child (32593) has found a proof. % 5.91/1.13 % 5.91/1.13 # Proof search is over... % 5.91/1.13 # Freeing feature tree %------------------------------------------------------------------------------