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