%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : FLD006-3 : 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 : n024.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:55 EDT 2022 % Result : Unsatisfiable 0.14s 0.40s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : FLD006-3 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n024.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 6 21:20:05 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V % 0.14/0.38 # and selection function PSelectComplexExceptRRHorn. % 0.14/0.38 # % 0.14/0.38 # Number of axioms: 27 Number of unprocessed: 27 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 27 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 1 conjectures. % 0.14/0.38 # There are 1 start rule candidates: % 0.14/0.38 # Found 4 unit axioms. % 0.14/0.38 # 1 start rule tableaux created. % 0.14/0.38 # 23 extension rule candidate clauses % 0.14/0.38 # 4 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 12 tableaux to operate on % 0.14/0.40 # There were 5 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 5 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 5 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_41, plain, (defined(additive_identity))). % 0.14/0.40 cnf(i_0_44, plain, (defined(multiplicative_identity))). % 0.14/0.40 cnf(i_0_42, plain, (defined(additive_inverse(X1))|~defined(X1))). % 0.14/0.40 cnf(i_0_50, plain, (less_or_equal(X2,X1)|less_or_equal(X1,X2)|~defined(X2)|~defined(X1))). % 0.14/0.40 cnf(i_0_40, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))). % 0.14/0.40 cnf(i_0_43, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))). % 0.14/0.40 cnf(i_0_49, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))). % 0.14/0.40 cnf(i_0_30, plain, (sum(additive_identity,X1,X1)|~defined(X1))). % 0.14/0.40 cnf(i_0_35, plain, (product(multiplicative_identity,X1,X1)|~defined(X1))). % 0.14/0.40 cnf(i_0_31, plain, (sum(additive_inverse(X1),X1,additive_identity)|~defined(X1))). % 0.14/0.40 cnf(i_0_45, plain, (defined(multiplicative_inverse(X1))|sum(additive_identity,X1,additive_identity)|~defined(X1))). % 0.14/0.40 cnf(i_0_53, plain, (~sum(additive_identity,additive_identity,multiplicative_identity))). % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~sum(additive_identity,additive_inverse(additive_identity),additive_identity))). % 0.14/0.40 cnf(i_0_46, plain, (sum(X1,X2,add(X1,X2))|~defined(X2)|~defined(X1))). % 0.14/0.40 cnf(i_0_47, plain, (product(X1,X2,multiply(X1,X2))|~defined(X2)|~defined(X1))). % 0.14/0.40 cnf(i_0_48, plain, (sum(additive_identity,X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))). % 0.14/0.40 cnf(i_0_36, plain, (sum(additive_identity,X1,additive_identity)|product(multiplicative_inverse(X1),X1,multiplicative_identity)|~defined(X1))). % 0.14/0.40 cnf(i_0_52, plain, (less_or_equal(additive_identity,X1)|~less_or_equal(additive_identity,X3)|~less_or_equal(additive_identity,X2)|~product(X2,X3,X1))). % 0.14/0.40 cnf(i_0_32, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.14/0.40 cnf(i_0_37, plain, (product(X1,X2,X3)|~product(X2,X1,X3))). % 0.14/0.40 cnf(i_0_51, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X4)|~sum(X4,X5,X2)|~sum(X3,X5,X1))). % 0.14/0.40 cnf(i_0_28, plain, (sum(X1,X2,X3)|~sum(X5,X6,X3)|~sum(X4,X6,X2)|~sum(X1,X4,X5))). % 0.14/0.40 cnf(i_0_29, plain, (sum(X1,X2,X3)|~sum(X5,X2,X6)|~sum(X4,X6,X3)|~sum(X4,X5,X1))). % 0.14/0.40 cnf(i_0_33, plain, (product(X1,X2,X3)|~product(X5,X6,X3)|~product(X4,X6,X2)|~product(X1,X4,X5))). % 0.14/0.40 cnf(i_0_34, plain, (product(X1,X2,X3)|~product(X5,X2,X6)|~product(X4,X6,X3)|~product(X4,X5,X1))). % 0.14/0.40 cnf(i_0_38, plain, (sum(X1,X2,X3)|~sum(X4,X5,X6)|~product(X6,X7,X3)|~product(X5,X7,X2)|~product(X4,X7,X1))). % 0.14/0.40 cnf(i_0_39, plain, (product(X1,X2,X3)|~sum(X6,X7,X3)|~sum(X4,X5,X1)|~product(X5,X2,X7)|~product(X4,X2,X6))). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 7 steps % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~sum(additive_identity,additive_inverse(additive_identity),additive_identity)), inference(start_rule)). % 0.14/0.40 cnf(i_0_55, plain, (~sum(additive_identity,additive_inverse(additive_identity),additive_identity)), inference(extension_rule, [i_0_29])). % 0.14/0.40 cnf(i_0_109, plain, (~sum(additive_identity,additive_inverse(additive_identity),additive_inverse(additive_identity))), inference(extension_rule, [i_0_30])). % 0.14/0.40 cnf(i_0_276, plain, (~defined(additive_inverse(additive_identity))), inference(etableau_closure_rule, [i_0_276, ...])). % 0.14/0.40 cnf(i_0_110, plain, (~sum(additive_inverse(additive_inverse(additive_identity)),additive_inverse(additive_identity),additive_identity)), inference(extension_rule, [i_0_31])). % 0.14/0.40 cnf(i_0_111, plain, (~sum(additive_inverse(additive_inverse(additive_identity)),additive_identity,additive_identity)), inference(etableau_closure_rule, [i_0_111, ...])). % 0.14/0.40 cnf(i_0_323, plain, (~defined(additive_inverse(additive_identity))), inference(etableau_closure_rule, [i_0_323, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Child (10894) has found a proof. % 0.14/0.40 % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------