%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : REL026-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 : n026.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:08 EDT 2022 % Result : Unsatisfiable 2.93s 0.79s % Output : CNFRefutation 2.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : REL026-2 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n026.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 8 14:37:55 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.19/0.36 # and selection function SelectNewComplexAHP. % 0.19/0.36 # % 0.19/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 14 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 2 conjectures. % 0.19/0.36 # There are 2 start rule candidates: % 0.19/0.36 # Found 13 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 2 start rule tableaux created. % 0.19/0.36 # 1 extension rule candidate clauses % 0.19/0.36 # 13 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 21 tableaux to operate on % 2.93/0.79 # There were 1 total branch saturation attempts. % 2.93/0.79 # There were 0 of these attempts blocked. % 2.93/0.79 # There were 0 deferred branch saturation attempts. % 2.93/0.79 # There were 0 free duplicated saturations. % 2.93/0.79 # There were 1 total successful branch saturations. % 2.93/0.79 # There were 0 successful branch saturations in interreduction. % 2.93/0.79 # There were 0 successful branch saturations on the branch. % 2.93/0.79 # There were 1 successful branch saturations after the branch. % 2.93/0.79 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.93/0.79 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.93/0.79 # Begin clausification derivation % 2.93/0.79 % 2.93/0.79 # End clausification derivation % 2.93/0.79 # Begin listing active clauses obtained from FOF to CNF conversion % 2.93/0.79 cnf(i_0_23, plain, (converse(converse(X1))=X1)). % 2.93/0.79 cnf(i_0_29, negated_conjecture, (join(sk1,one)=one)). % 2.93/0.79 cnf(i_0_21, plain, (composition(X1,one)=X1)). % 2.93/0.79 cnf(i_0_27, plain, (join(X1,complement(X1))=top)). % 2.93/0.79 cnf(i_0_16, plain, (join(X1,X2)=join(X2,X1))). % 2.93/0.79 cnf(i_0_24, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))). % 2.93/0.79 cnf(i_0_25, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))). % 2.93/0.79 cnf(i_0_28, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)). % 2.93/0.79 cnf(i_0_17, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 2.93/0.79 cnf(i_0_20, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). % 2.93/0.79 cnf(i_0_22, plain, (composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)))). % 2.93/0.79 cnf(i_0_26, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))). % 2.93/0.79 cnf(i_0_18, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)). % 2.93/0.79 cnf(i_0_30, negated_conjecture, (join(complement(join(complement(composition(sk1,top)),complement(sk2))),composition(sk1,sk2))!=composition(sk1,sk2)|join(composition(sk1,sk2),complement(join(complement(composition(sk1,top)),complement(sk2))))!=complement(join(complement(composition(sk1,top)),complement(sk2))))). % 2.93/0.79 cnf(i_0_40, plain, (X4=X4)). % 2.93/0.79 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.93/0.79 # Begin printing tableau % 2.93/0.79 # Found 6 steps % 2.93/0.79 cnf(i_0_23, plain, (converse(converse(X5))=X5), inference(start_rule)). % 2.93/0.79 cnf(i_0_48, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_44])). % 2.93/0.79 cnf(i_0_74, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_23])). % 2.93/0.79 cnf(i_0_73, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_43])). % 2.93/0.79 cnf(i_0_91, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_23])). % 2.93/0.79 cnf(i_0_89, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_89, ...])). % 2.93/0.79 # End printing tableau % 2.93/0.79 # SZS output end % 2.93/0.79 # Branches closed with saturation will be marked with an "s" % 2.93/0.80 # Child (30530) has found a proof. % 2.93/0.80 % 2.93/0.80 # Proof search is over... % 2.93/0.80 # Freeing feature tree %------------------------------------------------------------------------------