%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : REL050+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 : n022.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:45 EDT 2022 % Result : Theorem 20.21s 2.98s % Output : CNFRefutation 20.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : REL050+3 : 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 : n022.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 08:00:41 EDT 2022 % 0.12/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.12/0.38 # and selection function SelectNewComplexAHP. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 17 Number of unprocessed: 17 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 17 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 1 conjectures. % 0.12/0.38 # There are 1 start rule candidates: % 0.12/0.38 # Found 17 unit axioms. % 0.12/0.38 # 1 start rule tableaux created. % 0.12/0.38 # 0 extension rule candidate clauses % 0.12/0.38 # 17 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 26 tableaux to operate on % 20.21/2.98 # There were 1 total branch saturation attempts. % 20.21/2.98 # There were 0 of these attempts blocked. % 20.21/2.98 # There were 0 deferred branch saturation attempts. % 20.21/2.98 # There were 0 free duplicated saturations. % 20.21/2.98 # There were 1 total successful branch saturations. % 20.21/2.98 # There were 0 successful branch saturations in interreduction. % 20.21/2.98 # There were 0 successful branch saturations on the branch. % 20.21/2.98 # There were 1 successful branch saturations after the branch. % 20.21/2.98 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.21/2.98 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.21/2.98 # Begin clausification derivation % 20.21/2.98 % 20.21/2.98 # End clausification derivation % 20.21/2.98 # Begin listing active clauses obtained from FOF to CNF conversion % 20.21/2.98 cnf(i_0_8, plain, (converse(converse(X1))=X1)). % 20.21/2.98 cnf(i_0_6, plain, (composition(X1,one)=X1)). % 20.21/2.98 cnf(i_0_12, plain, (join(X1,complement(X1))=top)). % 20.21/2.98 cnf(i_0_13, plain, (meet(X1,complement(X1))=zero)). % 20.21/2.98 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))). % 20.21/2.98 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))). % 20.21/2.98 cnf(i_0_4, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))). % 20.21/2.98 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 20.21/2.98 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). % 20.21/2.98 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))). % 20.21/2.98 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))). % 20.21/2.98 cnf(i_0_3, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)). % 20.21/2.98 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))). % 20.21/2.98 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))). % 20.21/2.98 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))))). % 20.21/2.98 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))). % 20.21/2.98 cnf(i_0_17, negated_conjecture, (composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top)))). % 20.21/2.98 cnf(i_0_19, plain, (X39=X39)). % 20.21/2.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 20.21/2.98 # Begin printing tableau % 20.21/2.98 # Found 6 steps % 20.21/2.98 cnf(i_0_8, plain, (converse(converse(X5))=X5), inference(start_rule)). % 20.21/2.98 cnf(i_0_28, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_23])). % 20.21/2.98 cnf(i_0_54, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_8])). % 20.21/2.98 cnf(i_0_53, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_22])). % 20.21/2.98 cnf(i_0_72, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_8])). % 20.21/2.98 cnf(i_0_70, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_70, ...])). % 20.21/2.98 # End printing tableau % 20.21/2.98 # SZS output end % 20.21/2.98 # Branches closed with saturation will be marked with an "s" % 20.94/2.99 # Child (9807) has found a proof. % 20.94/2.99 % 20.94/2.99 # Proof search is over... % 20.94/2.99 # Freeing feature tree %------------------------------------------------------------------------------