%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO014-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 : n028.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 23:38:26 EDT 2022 % Result : Unsatisfiable 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : BOO014-2 : TPTP v8.1.0. Released v1.0.0. % 0.12/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.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Wed Jun 1 17:05:52 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 17 Number of unprocessed: 15 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 15 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 15 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 0 extension rule candidate clauses % 0.19/0.36 # 15 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 22 tableaux to operate on % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_32, hypothesis, (add(a,b)=c)). % 0.19/0.42 cnf(i_0_30, plain, (add(X1,additive_identity)=X1)). % 0.19/0.42 cnf(i_0_28, plain, (multiply(X1,multiplicative_identity)=X1)). % 0.19/0.42 cnf(i_0_31, plain, (add(additive_identity,X1)=X1)). % 0.19/0.42 cnf(i_0_29, plain, (multiply(multiplicative_identity,X1)=X1)). % 0.19/0.42 cnf(i_0_24, plain, (add(X1,inverse(X1))=multiplicative_identity)). % 0.19/0.42 cnf(i_0_26, plain, (multiply(X1,inverse(X1))=additive_identity)). % 0.19/0.42 cnf(i_0_33, hypothesis, (multiply(inverse(a),inverse(b))=d)). % 0.19/0.42 cnf(i_0_21, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))). % 0.19/0.42 cnf(i_0_23, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). % 0.19/0.42 cnf(i_0_20, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))). % 0.19/0.42 cnf(i_0_22, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))). % 0.19/0.42 cnf(i_0_18, plain, (add(X1,X2)=add(X2,X1))). % 0.19/0.42 cnf(i_0_19, plain, (multiply(X1,X2)=multiply(X2,X1))). % 0.19/0.42 cnf(i_0_34, negated_conjecture, (inverse(c)!=d)). % 0.19/0.42 cnf(i_0_36, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 6 steps % 0.19/0.42 cnf(i_0_32, hypothesis, (add(a,b)=c), inference(start_rule)). % 0.19/0.42 cnf(i_0_43, plain, (add(a,b)=c), inference(extension_rule, [i_0_40])). % 0.19/0.42 cnf(i_0_67, plain, (add(a,b)!=c), inference(closure_rule, [i_0_32])). % 0.19/0.42 cnf(i_0_66, plain, (add(add(a,b),add(a,b))=add(c,c)), inference(extension_rule, [i_0_39])). % 0.19/0.42 cnf(i_0_80, plain, (add(c,c)!=add(add(c,c),additive_identity)), inference(closure_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_78, plain, (add(add(a,b),add(a,b))=add(add(c,c),additive_identity)), inference(etableau_closure_rule, [i_0_78, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Child (23592) has found a proof. % 0.19/0.42 % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------