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