%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG014-6 : TPTP v8.1.0. Released v1.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 20:27:05 EDT 2022 % Result : Unsatisfiable 0.20s 0.49s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : RNG014-6 : TPTP v8.1.0. Released v1.0.0. % 0.10/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 : Mon May 30 07:11:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 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 # 14 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 14 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 14 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 1 % 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 20 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 20 tableaux to operate on % 0.20/0.49 # There were 1 total branch saturation attempts. % 0.20/0.49 # There were 0 of these attempts blocked. % 0.20/0.49 # There were 0 deferred branch saturation attempts. % 0.20/0.49 # There were 0 free duplicated saturations. % 0.20/0.49 # There were 1 total successful branch saturations. % 0.20/0.49 # There were 0 successful branch saturations in interreduction. % 0.20/0.49 # There were 0 successful branch saturations on the branch. % 0.20/0.49 # There were 1 successful branch saturations after the branch. % 0.20/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.49 # Begin clausification derivation % 0.20/0.49 % 0.20/0.49 # End clausification derivation % 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.49 cnf(i_0_23, plain, (additive_inverse(additive_inverse(X1))=X1)). % 0.20/0.49 cnf(i_0_20, plain, (multiply(X1,additive_identity)=additive_identity)). % 0.20/0.49 cnf(i_0_19, plain, (multiply(additive_identity,X1)=additive_identity)). % 0.20/0.49 cnf(i_0_18, plain, (add(X1,additive_identity)=X1)). % 0.20/0.49 cnf(i_0_17, plain, (add(additive_identity,X1)=X1)). % 0.20/0.49 cnf(i_0_22, plain, (add(X1,additive_inverse(X1))=additive_identity)). % 0.20/0.49 cnf(i_0_21, plain, (add(additive_inverse(X1),X1)=additive_identity)). % 0.20/0.49 cnf(i_0_26, plain, (add(X1,X2)=add(X2,X1))). % 0.20/0.49 cnf(i_0_32, negated_conjecture, (additive_inverse(multiply(a,b))!=multiply(a,additive_inverse(b)))). % 0.20/0.49 cnf(i_0_27, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.20/0.49 cnf(i_0_28, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))). % 0.20/0.49 cnf(i_0_29, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))). % 0.20/0.49 cnf(i_0_24, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). % 0.20/0.49 cnf(i_0_25, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))). % 0.20/0.49 cnf(i_0_34, plain, (X4=X4)). % 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.49 # Begin printing tableau % 0.20/0.49 # Found 6 steps % 0.20/0.49 cnf(i_0_19, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(start_rule)). % 0.20/0.49 cnf(i_0_43, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(extension_rule, [i_0_37])). % 0.20/0.49 cnf(i_0_77, plain, (additive_inverse(additive_inverse(additive_identity))!=additive_identity), inference(closure_rule, [i_0_23])). % 0.20/0.49 cnf(i_0_75, plain, (multiply(additive_identity,additive_identity)=additive_inverse(additive_inverse(additive_identity))), inference(extension_rule, [i_0_38])). % 0.20/0.49 cnf(i_0_84, plain, (additive_inverse(additive_inverse(X4))!=X4), inference(closure_rule, [i_0_23])). % 0.20/0.49 cnf(i_0_82, plain, (add(multiply(additive_identity,additive_identity),additive_inverse(additive_inverse(X4)))=add(additive_inverse(additive_inverse(additive_identity)),X4)), inference(etableau_closure_rule, [i_0_82, ...])). % 0.20/0.49 # End printing tableau % 0.20/0.49 # SZS output end % 0.20/0.49 # Branches closed with saturation will be marked with an "s" % 0.20/0.49 # Child (20469) has found a proof. % 0.20/0.49 % 0.20/0.49 # Proof search is over... % 0.20/0.49 # Freeing feature tree %------------------------------------------------------------------------------