%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG005-2 : 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 : n017.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:02 EDT 2022 % Result : Unsatisfiable 12.32s 1.92s % Output : CNFRefutation 12.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : RNG005-2 : TPTP v8.1.0. Released v1.0.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 : n017.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 May 30 17:07:10 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___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.12/0.36 # and selection function SelectCQArEqLast. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 31 Number of unprocessed: 31 % 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 # 31 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 11 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 20 extension rule candidate clauses % 0.12/0.36 # 11 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 1 % 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 12.32/1.92 # There were 1 total branch saturation attempts. % 12.32/1.92 # There were 0 of these attempts blocked. % 12.32/1.92 # There were 0 deferred branch saturation attempts. % 12.32/1.92 # There were 0 free duplicated saturations. % 12.32/1.92 # There were 1 total successful branch saturations. % 12.32/1.92 # There were 0 successful branch saturations in interreduction. % 12.32/1.92 # There were 0 successful branch saturations on the branch. % 12.32/1.92 # There were 1 successful branch saturations after the branch. % 12.32/1.92 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.32/1.92 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.32/1.92 # Begin clausification derivation % 12.32/1.92 % 12.32/1.92 # End clausification derivation % 12.32/1.92 # Begin listing active clauses obtained from FOF to CNF conversion % 12.32/1.92 cnf(i_0_42, plain, (sum(X1,additive_identity,X1))). % 12.32/1.92 cnf(i_0_41, plain, (sum(additive_identity,X1,X1))). % 12.32/1.92 cnf(i_0_59, plain, (product(X1,additive_identity,additive_identity))). % 12.32/1.92 cnf(i_0_58, plain, (product(additive_identity,X1,additive_identity))). % 12.32/1.92 cnf(i_0_60, hypothesis, (product(a,b,d))). % 12.32/1.92 cnf(i_0_46, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 12.32/1.92 cnf(i_0_61, hypothesis, (product(additive_inverse(a),b,c))). % 12.32/1.92 cnf(i_0_45, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 12.32/1.92 cnf(i_0_44, plain, (sum(X1,X2,add(X1,X2)))). % 12.32/1.92 cnf(i_0_43, plain, (product(X1,X2,multiply(X1,X2)))). % 12.32/1.92 cnf(i_0_62, negated_conjecture, (~sum(c,d,additive_identity))). % 12.32/1.92 cnf(i_0_32, plain, (equalish(additive_inverse(X1),additive_inverse(X2))|~equalish(X1,X2))). % 12.32/1.92 cnf(i_0_49, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 12.32/1.92 cnf(i_0_36, plain, (sum(X1,X2,X3)|~sum(X1,X2,X4)|~equalish(X4,X3))). % 12.32/1.92 cnf(i_0_35, plain, (sum(X1,X2,X3)|~sum(X1,X4,X3)|~equalish(X4,X2))). % 12.32/1.92 cnf(i_0_34, plain, (sum(X1,X2,X3)|~sum(X4,X2,X3)|~equalish(X4,X1))). % 12.32/1.92 cnf(i_0_33, plain, (equalish(add(X1,X2),add(X3,X2))|~equalish(X1,X3))). % 12.32/1.92 cnf(i_0_37, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))). % 12.32/1.92 cnf(i_0_56, plain, (equalish(X1,X2)|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 12.32/1.92 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))). % 12.32/1.92 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))). % 12.32/1.92 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))). % 12.32/1.92 cnf(i_0_48, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 12.32/1.92 cnf(i_0_47, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 12.32/1.92 cnf(i_0_57, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 12.32/1.92 cnf(i_0_51, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 12.32/1.92 cnf(i_0_50, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 12.32/1.92 cnf(i_0_52, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 12.32/1.92 cnf(i_0_54, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 12.32/1.92 cnf(i_0_55, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 12.32/1.92 cnf(i_0_53, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 12.32/1.92 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 12.32/1.92 # Begin printing tableau % 12.32/1.92 # Found 6 steps % 12.32/1.92 cnf(i_0_62, negated_conjecture, (~sum(c,d,additive_identity)), inference(start_rule)). % 12.32/1.92 cnf(i_0_63, plain, (~sum(c,d,additive_identity)), inference(extension_rule, [i_0_35])). % 12.32/1.92 cnf(i_0_72, plain, (~sum(c,additive_inverse(c),additive_identity)), inference(closure_rule, [i_0_46])). % 12.32/1.92 cnf(i_0_73, plain, (~equalish(additive_inverse(c),d)), inference(extension_rule, [i_0_56])). % 12.32/1.92 cnf(i_0_150, plain, (~sum(d,additive_identity,d)), inference(closure_rule, [i_0_42])). % 12.32/1.92 cnf(i_0_151, plain, (~sum(d,additive_identity,additive_inverse(c))), inference(etableau_closure_rule, [i_0_151, ...])). % 12.32/1.92 # End printing tableau % 12.32/1.92 # SZS output end % 12.32/1.92 # Branches closed with saturation will be marked with an "s" % 12.32/1.92 # There were 1 total branch saturation attempts. % 12.32/1.92 # There were 0 of these attempts blocked. % 12.32/1.92 # There were 0 deferred branch saturation attempts. % 12.32/1.92 # There were 0 free duplicated saturations. % 12.32/1.92 # There were 1 total successful branch saturations. % 12.32/1.92 # There were 0 successful branch saturations in interreduction. % 12.32/1.92 # There were 0 successful branch saturations on the branch. % 12.32/1.92 # There were 1 successful branch saturations after the branch. % 12.32/1.92 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.32/1.92 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.32/1.92 # Begin clausification derivation % 12.32/1.92 % 12.32/1.92 # End clausification derivation % 12.32/1.92 # Begin listing active clauses obtained from FOF to CNF conversion % 12.32/1.92 cnf(i_0_42, plain, (sum(X1,additive_identity,X1))). % 12.32/1.92 cnf(i_0_41, plain, (sum(additive_identity,X1,X1))). % 12.32/1.92 cnf(i_0_59, plain, (product(X1,additive_identity,additive_identity))). % 12.32/1.92 cnf(i_0_58, plain, (product(additive_identity,X1,additive_identity))). % 12.32/1.92 cnf(i_0_60, hypothesis, (product(a,b,d))). % 12.32/1.92 cnf(i_0_46, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 12.32/1.92 cnf(i_0_61, hypothesis, (product(additive_inverse(a),b,c))). % 12.32/1.92 cnf(i_0_45, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 12.32/1.92 cnf(i_0_44, plain, (sum(X1,X2,add(X1,X2)))). % 12.32/1.92 cnf(i_0_43, plain, (product(X1,X2,multiply(X1,X2)))). % 12.32/1.92 cnf(i_0_62, negated_conjecture, (~sum(c,d,additive_identity))). % 12.32/1.92 cnf(i_0_32, plain, (equalish(additive_inverse(X1),additive_inverse(X2))|~equalish(X1,X2))). % 12.32/1.92 cnf(i_0_49, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 12.32/1.92 cnf(i_0_36, plain, (sum(X1,X2,X3)|~sum(X1,X2,X4)|~equalish(X4,X3))). % 12.32/1.92 cnf(i_0_35, plain, (sum(X1,X2,X3)|~sum(X1,X4,X3)|~equalish(X4,X2))). % 12.32/1.92 cnf(i_0_34, plain, (sum(X1,X2,X3)|~sum(X4,X2,X3)|~equalish(X4,X1))). % 12.32/1.92 cnf(i_0_33, plain, (equalish(add(X1,X2),add(X3,X2))|~equalish(X1,X3))). % 12.32/1.92 cnf(i_0_37, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))). % 12.32/1.92 cnf(i_0_56, plain, (equalish(X1,X2)|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 12.32/1.92 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))). % 12.32/1.92 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))). % 12.32/1.92 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))). % 12.32/1.92 cnf(i_0_48, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 12.32/1.92 cnf(i_0_47, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 12.32/1.92 cnf(i_0_57, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 12.32/1.92 cnf(i_0_51, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 12.32/1.92 cnf(i_0_50, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 12.32/1.92 cnf(i_0_52, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 12.32/1.92 cnf(i_0_54, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 12.32/1.92 cnf(i_0_55, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 12.32/1.92 cnf(i_0_53, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 12.32/1.92 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 12.32/1.92 # Begin printing tableau % 12.32/1.92 # Found 6 steps % 12.32/1.92 cnf(i_0_62, negated_conjecture, (~sum(c,d,additive_identity)), inference(start_rule)). % 12.32/1.92 cnf(i_0_63, plain, (~sum(c,d,additive_identity)), inference(extension_rule, [i_0_48])). % 12.32/1.92 cnf(i_0_94, plain, (~sum(additive_identity,d,d)), inference(closure_rule, [i_0_41])). % 12.32/1.92 cnf(i_0_95, plain, (~sum(additive_inverse(d),d,additive_identity)), inference(closure_rule, [i_0_45])). % 12.32/1.92 cnf(i_0_96, plain, (~sum(additive_inverse(d),additive_identity,c)), inference(extension_rule, [i_0_49])). % 12.32/1.92 cnf(i_0_135, plain, (~sum(additive_identity,additive_inverse(d),c)), inference(etableau_closure_rule, [i_0_135, ...])). % 12.32/1.92 # End printing tableau % 12.32/1.92 # SZS output end % 12.32/1.92 # Branches closed with saturation will be marked with an "s" % 12.32/1.93 # Child (13915) has found a proof. % 12.32/1.93 % 12.32/1.93 # Proof search is over... % 12.32/1.93 # Freeing feature tree %------------------------------------------------------------------------------