%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.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 : n025.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:27 EDT 2022 % Result : Unsatisfiable 0.19s 0.51s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.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.13/0.34 % Computer : n025.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 1 21:32:59 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 26 Number of unprocessed: 26 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 26 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 26 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 26 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 47 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 47 tableaux to operate on % 0.19/0.51 # There were 1 total branch saturation attempts. % 0.19/0.51 # There were 0 of these attempts blocked. % 0.19/0.51 # There were 0 deferred branch saturation attempts. % 0.19/0.51 # There were 0 free duplicated saturations. % 0.19/0.51 # There were 1 total successful branch saturations. % 0.19/0.51 # There were 0 successful branch saturations in interreduction. % 0.19/0.51 # There were 0 successful branch saturations on the branch. % 0.19/0.51 # There were 1 successful branch saturations after the branch. % 0.19/0.51 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.51 # Begin clausification derivation % 0.19/0.51 % 0.19/0.51 # End clausification derivation % 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.51 cnf(i_0_51, hypothesis, (sum(x,y,z)=true)). % 0.19/0.51 cnf(i_0_34, plain, (sum(X1,additive_identity,X1)=true)). % 0.19/0.51 cnf(i_0_36, plain, (product(X1,multiplicative_identity,X1)=true)). % 0.19/0.51 cnf(i_0_33, plain, (sum(additive_identity,X1,X1)=true)). % 0.19/0.51 cnf(i_0_35, plain, (product(multiplicative_identity,X1,X1)=true)). % 0.19/0.51 cnf(i_0_46, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)). % 0.19/0.51 cnf(i_0_48, plain, (product(X1,inverse(X1),additive_identity)=true)). % 0.19/0.51 cnf(i_0_45, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)). % 0.19/0.51 cnf(i_0_47, plain, (product(inverse(X1),X1,additive_identity)=true)). % 0.19/0.51 cnf(i_0_27, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.51 cnf(i_0_28, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.51 cnf(i_0_29, plain, (sum(X1,X2,add(X1,X2))=true)). % 0.19/0.51 cnf(i_0_30, plain, (product(X1,X2,multiply(X1,X2))=true)). % 0.19/0.51 cnf(i_0_32, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)). % 0.19/0.51 cnf(i_0_31, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)). % 0.19/0.51 cnf(i_0_49, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)). % 0.19/0.51 cnf(i_0_50, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)). % 0.19/0.51 cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_44, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)). % 0.19/0.51 cnf(i_0_52, negated_conjecture, (product(x,z,x)!=true)). % 0.19/0.51 cnf(i_0_54, plain, (X8=X8)). % 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.51 # Begin printing tableau % 0.19/0.51 # Found 9 steps % 0.19/0.51 cnf(i_0_51, hypothesis, (sum(x,y,z)=true), inference(start_rule)). % 0.19/0.51 cnf(i_0_65, plain, (sum(x,y,z)=true), inference(extension_rule, [i_0_61])). % 0.19/0.51 cnf(i_0_113, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_51])). % 0.19/0.51 cnf(i_0_115, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_51])). % 0.19/0.51 cnf(i_0_112, plain, (sum(sum(x,y,z),sum(x,y,z),sum(x,y,z))=sum(true,true,true)), inference(extension_rule, [i_0_58])). % 0.19/0.51 cnf(i_0_248, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_51])). % 0.19/0.51 cnf(i_0_249, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_51])). % 0.19/0.51 cnf(i_0_250, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_51])). % 0.19/0.51 cnf(i_0_246, plain, (ifeq2(sum(sum(x,y,z),sum(x,y,z),sum(x,y,z)),sum(x,y,z),sum(x,y,z),sum(x,y,z))=ifeq2(sum(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_246, ...])). % 0.19/0.51 # End printing tableau % 0.19/0.51 # SZS output end % 0.19/0.51 # Branches closed with saturation will be marked with an "s" % 0.19/0.51 # Child (24271) has found a proof. % 0.19/0.51 % 0.19/0.52 # Proof search is over... % 0.19/0.52 # Freeing feature tree %------------------------------------------------------------------------------