%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO008-4 : TPTP v8.1.0. Released v1.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 : Thu Jul 14 23:38:23 EDT 2022 % Result : Unsatisfiable 1.87s 0.59s % Output : CNFRefutation 1.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : BOO008-4 : TPTP v8.1.0. Released v1.1.0. % 0.11/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 : n024.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 16:32:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 9 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 9 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 0 extension rule candidate clauses % 0.13/0.36 # 9 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Creating equality axioms % 0.13/0.36 # Ran out of tableaux, making start rules for all clauses % 0.13/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 15 tableaux to operate on % 1.87/0.59 # There were 1 total branch saturation attempts. % 1.87/0.59 # There were 0 of these attempts blocked. % 1.87/0.59 # There were 0 deferred branch saturation attempts. % 1.87/0.59 # There were 0 free duplicated saturations. % 1.87/0.59 # There were 1 total successful branch saturations. % 1.87/0.59 # There were 0 successful branch saturations in interreduction. % 1.87/0.59 # There were 0 successful branch saturations on the branch. % 1.87/0.59 # There were 1 successful branch saturations after the branch. % 1.87/0.59 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.87/0.59 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.87/0.59 # Begin clausification derivation % 1.87/0.59 % 1.87/0.59 # End clausification derivation % 1.87/0.59 # Begin listing active clauses obtained from FOF to CNF conversion % 1.87/0.59 cnf(i_0_14, plain, (add(X1,additive_identity)=X1)). % 1.87/0.59 cnf(i_0_15, plain, (multiply(X1,multiplicative_identity)=X1)). % 1.87/0.59 cnf(i_0_16, plain, (add(X1,inverse(X1))=multiplicative_identity)). % 1.87/0.59 cnf(i_0_17, plain, (multiply(X1,inverse(X1))=additive_identity)). % 1.87/0.59 cnf(i_0_12, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))). % 1.87/0.59 cnf(i_0_13, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). % 1.87/0.59 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 1.87/0.59 cnf(i_0_11, plain, (multiply(X1,X2)=multiply(X2,X1))). % 1.87/0.59 cnf(i_0_18, negated_conjecture, (add(c,add(a,b))!=add(a,add(b,c)))). % 1.87/0.59 cnf(i_0_20, plain, (X4=X4)). % 1.87/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.87/0.59 # Begin printing tableau % 1.87/0.59 # Found 6 steps % 1.87/0.59 cnf(i_0_16, plain, (add(multiplicative_identity,inverse(multiplicative_identity))=multiplicative_identity), inference(start_rule)). % 1.87/0.59 cnf(i_0_29, plain, (add(multiplicative_identity,inverse(multiplicative_identity))=multiplicative_identity), inference(extension_rule, [i_0_23])). % 1.87/0.59 cnf(i_0_58, plain, (add(multiplicative_identity,additive_identity)!=multiplicative_identity), inference(closure_rule, [i_0_14])). % 1.87/0.59 cnf(i_0_56, plain, (add(multiplicative_identity,inverse(multiplicative_identity))=add(multiplicative_identity,additive_identity)), inference(extension_rule, [i_0_24])). % 1.87/0.59 cnf(i_0_65, plain, (add(X4,additive_identity)!=X4), inference(closure_rule, [i_0_14])). % 1.87/0.59 cnf(i_0_63, plain, (add(add(multiplicative_identity,inverse(multiplicative_identity)),add(X4,additive_identity))=add(add(multiplicative_identity,additive_identity),X4)), inference(etableau_closure_rule, [i_0_63, ...])). % 1.87/0.59 # End printing tableau % 1.87/0.59 # SZS output end % 1.87/0.59 # Branches closed with saturation will be marked with an "s" % 1.87/0.59 # Child (1918) has found a proof. % 1.87/0.59 % 1.87/0.59 # Proof search is over... % 1.87/0.59 # Freeing feature tree %------------------------------------------------------------------------------