%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG002-1 : 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 : n027.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 : Thu Jul 14 16:51:07 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0. % 0.10/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 : n027.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 : Wed Jun 8 11:31:11 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 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 # 14 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 4 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 10 extension rule candidate clauses % 0.12/0.36 # 4 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.37 # There were 2 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 2 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 2 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_27, hypothesis, (greater_than_0(a))). % 0.12/0.37 cnf(i_0_15, plain, (product(X1,multiplicative_identity,X1))). % 0.12/0.37 cnf(i_0_28, negated_conjecture, (~greater_than_0(multiplicative_inverse(a)))). % 0.12/0.37 cnf(i_0_16, plain, (~product(multiplicative_identity,multiplicative_identity,additive_identity))). % 0.12/0.37 cnf(i_0_21, plain, (~greater_than_0(additive_inverse(X1))|~greater_than_0(X1))). % 0.12/0.37 cnf(i_0_22, plain, (~greater_than_0(X1)|~product(X1,X1,additive_identity))). % 0.12/0.37 cnf(i_0_20, plain, (product(X1,multiplicative_inverse(X1),multiplicative_identity)|product(X1,X1,additive_identity))). % 0.12/0.37 cnf(i_0_26, plain, (greater_than_0(X1)|~greater_than_0(X2)|~greater_than_0(X3)|~product(X3,X2,X1))). % 0.12/0.37 cnf(i_0_23, plain, (product(X1,X2,X3)|~product(X2,X1,X3))). % 0.12/0.37 cnf(i_0_18, plain, (product(X1,X2,X3)|~product(additive_inverse(X1),additive_inverse(X2),X3))). % 0.12/0.37 cnf(i_0_19, plain, (product(X1,additive_inverse(X2),additive_inverse(X3))|~product(X1,X2,X3))). % 0.12/0.37 cnf(i_0_24, plain, (greater_than_0(additive_inverse(X1))|greater_than_0(X1)|product(X1,X1,additive_identity))). % 0.12/0.37 cnf(i_0_17, plain, (product(additive_inverse(X1),additive_inverse(X2),X3)|~product(X1,X2,X3))). % 0.12/0.37 cnf(i_0_25, plain, (product(X1,X1,additive_identity)|~product(X2,X2,additive_identity)|~product(X2,X3,X1))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 5 steps % 0.12/0.37 cnf(i_0_28, negated_conjecture, (~greater_than_0(multiplicative_inverse(a))), inference(start_rule)). % 0.12/0.37 cnf(i_0_29, plain, (~greater_than_0(multiplicative_inverse(a))), inference(extension_rule, [i_0_24])). % 0.12/0.37 cnf(i_0_46, plain, (greater_than_0(additive_inverse(multiplicative_inverse(a)))), inference(extension_rule, [i_0_21])). % 0.12/0.37 cnf(i_0_48, plain, (product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)), inference(etableau_closure_rule, [i_0_48, ...])). % 0.12/0.37 cnf(i_0_54, plain, (~greater_than_0(additive_inverse(additive_inverse(multiplicative_inverse(a))))), inference(etableau_closure_rule, [i_0_54, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 2 tableaux to operate on % 0.12/0.37 # Found closed tableau during pool population. % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------