%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : FLD012-4 : TPTP v8.1.0. Bugfixed v2.1.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 : n018.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 : Sat Jul 16 02:05:58 EDT 2022 % Result : Unsatisfiable 2.12s 0.63s % Output : CNFRefutation 2.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : FLD012-4 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.11/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 : n018.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 : Mon Jun 6 20:42:05 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 35 Number of unprocessed: 35 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 35 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 5 conjectures. % 0.12/0.36 # There are 5 start rule candidates: % 0.12/0.36 # Found 12 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 5 start rule tableaux created. % 0.12/0.36 # 23 extension rule candidate clauses % 0.12/0.36 # 12 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 5 % 0.12/0.36 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 14 tableaux to operate on % 2.12/0.63 # There were 1 total branch saturation attempts. % 2.12/0.63 # There were 0 of these attempts blocked. % 2.12/0.63 # There were 0 deferred branch saturation attempts. % 2.12/0.63 # There were 0 free duplicated saturations. % 2.12/0.63 # There were 1 total successful branch saturations. % 2.12/0.63 # There were 0 successful branch saturations in interreduction. % 2.12/0.63 # There were 0 successful branch saturations on the branch. % 2.12/0.63 # There were 1 successful branch saturations after the branch. % 2.12/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.12/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.12/0.63 # Begin clausification derivation % 2.12/0.63 % 2.12/0.63 # End clausification derivation % 2.12/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 2.12/0.63 cnf(i_0_49, plain, (defined(additive_identity))). % 2.12/0.63 cnf(i_0_52, plain, (defined(multiplicative_identity))). % 2.12/0.63 cnf(i_0_62, hypothesis, (defined(a))). % 2.12/0.63 cnf(i_0_63, hypothesis, (defined(b))). % 2.12/0.63 cnf(i_0_64, hypothesis, (defined(u))). % 2.12/0.63 cnf(i_0_65, hypothesis, (defined(v))). % 2.12/0.63 cnf(i_0_50, plain, (defined(additive_inverse(X1))|~defined(X1))). % 2.12/0.63 cnf(i_0_58, plain, (less_or_equal(X2,X1)|less_or_equal(X1,X2)|~defined(X2)|~defined(X1))). % 2.12/0.63 cnf(i_0_48, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))). % 2.12/0.63 cnf(i_0_51, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))). % 2.12/0.63 cnf(i_0_68, negated_conjecture, (product(a,b,u))). % 2.12/0.63 cnf(i_0_69, negated_conjecture, (product(multiplicative_inverse(a),multiplicative_inverse(b),v))). % 2.12/0.63 cnf(i_0_57, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))). % 2.12/0.63 cnf(i_0_38, plain, (sum(additive_identity,X1,X1)|~defined(X1))). % 2.12/0.63 cnf(i_0_43, plain, (product(multiplicative_identity,X1,X1)|~defined(X1))). % 2.12/0.63 cnf(i_0_39, plain, (sum(additive_inverse(X1),X1,additive_identity)|~defined(X1))). % 2.12/0.63 cnf(i_0_53, plain, (defined(multiplicative_inverse(X1))|sum(additive_identity,X1,additive_identity)|~defined(X1))). % 2.12/0.63 cnf(i_0_61, plain, (~sum(additive_identity,additive_identity,multiplicative_identity))). % 2.12/0.63 cnf(i_0_66, negated_conjecture, (~sum(additive_identity,a,additive_identity))). % 2.12/0.63 cnf(i_0_67, negated_conjecture, (~sum(additive_identity,b,additive_identity))). % 2.12/0.63 cnf(i_0_70, negated_conjecture, (~product(multiplicative_identity,multiplicative_inverse(u),v))). % 2.12/0.63 cnf(i_0_54, plain, (sum(X1,X2,add(X1,X2))|~defined(X2)|~defined(X1))). % 2.12/0.63 cnf(i_0_55, plain, (product(X1,X2,multiply(X1,X2))|~defined(X2)|~defined(X1))). % 2.12/0.63 cnf(i_0_56, plain, (sum(additive_identity,X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))). % 2.12/0.63 cnf(i_0_44, plain, (sum(additive_identity,X1,additive_identity)|product(multiplicative_inverse(X1),X1,multiplicative_identity)|~defined(X1))). % 2.12/0.63 cnf(i_0_60, plain, (less_or_equal(additive_identity,X1)|~less_or_equal(additive_identity,X3)|~less_or_equal(additive_identity,X2)|~product(X2,X3,X1))). % 2.12/0.63 cnf(i_0_40, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 2.12/0.63 cnf(i_0_45, plain, (product(X1,X2,X3)|~product(X2,X1,X3))). % 2.12/0.63 cnf(i_0_59, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X4)|~sum(X4,X5,X2)|~sum(X3,X5,X1))). % 2.12/0.63 cnf(i_0_36, plain, (sum(X1,X2,X3)|~sum(X5,X6,X3)|~sum(X4,X6,X2)|~sum(X1,X4,X5))). % 2.12/0.63 cnf(i_0_37, plain, (sum(X1,X2,X3)|~sum(X5,X2,X6)|~sum(X4,X6,X3)|~sum(X4,X5,X1))). % 2.12/0.63 cnf(i_0_41, plain, (product(X1,X2,X3)|~product(X5,X6,X3)|~product(X4,X6,X2)|~product(X1,X4,X5))). % 2.12/0.63 cnf(i_0_42, plain, (product(X1,X2,X3)|~product(X5,X2,X6)|~product(X4,X6,X3)|~product(X4,X5,X1))). % 2.12/0.63 cnf(i_0_46, plain, (sum(X1,X2,X3)|~sum(X4,X5,X6)|~product(X6,X7,X3)|~product(X5,X7,X2)|~product(X4,X7,X1))). % 2.12/0.63 cnf(i_0_47, plain, (product(X1,X2,X3)|~sum(X6,X7,X3)|~sum(X4,X5,X1)|~product(X5,X2,X7)|~product(X4,X2,X6))). % 2.12/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.12/0.63 # Begin printing tableau % 2.12/0.63 # Found 8 steps % 2.12/0.63 cnf(i_0_67, negated_conjecture, (~sum(additive_identity,b,additive_identity)), inference(start_rule)). % 2.12/0.63 cnf(i_0_72, plain, (~sum(additive_identity,b,additive_identity)), inference(extension_rule, [i_0_37])). % 2.12/0.63 cnf(i_0_203, plain, (~sum(additive_identity,b,b)), inference(extension_rule, [i_0_38])). % 2.12/0.63 cnf(i_0_240, plain, (~defined(b)), inference(closure_rule, [i_0_63])). % 2.12/0.63 cnf(i_0_204, plain, (~sum(additive_inverse(b),b,additive_identity)), inference(extension_rule, [i_0_39])). % 2.12/0.63 cnf(i_0_259, plain, (~defined(b)), inference(closure_rule, [i_0_63])). % 2.12/0.63 cnf(i_0_205, plain, (~sum(additive_inverse(b),additive_identity,additive_identity)), inference(extension_rule, [i_0_40])). % 2.12/0.63 cnf(i_0_297, plain, (~sum(additive_identity,additive_inverse(b),additive_identity)), inference(etableau_closure_rule, [i_0_297, ...])). % 2.12/0.63 # End printing tableau % 2.12/0.63 # SZS output end % 2.12/0.63 # Branches closed with saturation will be marked with an "s" % 2.12/0.63 # Child (13574) has found a proof. % 2.12/0.63 % 2.12/0.63 # Proof search is over... % 2.12/0.63 # Freeing feature tree %------------------------------------------------------------------------------