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