%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP728-1 : TPTP v8.1.0. Released v4.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 : n004.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 : Sat Jul 16 09:08:14 EDT 2022 % Result : Unsatisfiable 1.66s 0.59s % Output : CNFRefutation 1.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : GRP728-1 : TPTP v8.1.0. Released v4.0.0. % 0.04/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 : n004.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 : Tue Jun 14 04:32:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y % 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 20 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 20 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 0 extension rule candidate clauses % 0.20/0.37 # 20 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 31 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 31 tableaux to operate on % 1.66/0.59 # There were 1 total branch saturation attempts. % 1.66/0.59 # There were 0 of these attempts blocked. % 1.66/0.59 # There were 0 deferred branch saturation attempts. % 1.66/0.59 # There were 0 free duplicated saturations. % 1.66/0.59 # There were 1 total successful branch saturations. % 1.66/0.59 # There were 0 successful branch saturations in interreduction. % 1.66/0.59 # There were 0 successful branch saturations on the branch. % 1.66/0.59 # There were 1 successful branch saturations after the branch. % 1.66/0.59 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.66/0.59 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.66/0.59 # Begin clausification derivation % 1.66/0.59 % 1.66/0.59 # End clausification derivation % 1.66/0.59 # Begin listing active clauses obtained from FOF to CNF conversion % 1.66/0.59 cnf(i_0_25, plain, (mult(X1,unit)=X1)). % 1.66/0.59 cnf(i_0_24, plain, (mult(unit,X1)=X1)). % 1.66/0.59 cnf(i_0_26, plain, (mult(X1,i(X1))=unit)). % 1.66/0.59 cnf(i_0_27, plain, (mult(i(X1),X1)=unit)). % 1.66/0.59 cnf(i_0_31, plain, (mult(rd(X1,X2),X2)=X1)). % 1.66/0.59 cnf(i_0_30, plain, (rd(mult(X1,X2),X2)=X1)). % 1.66/0.59 cnf(i_0_29, plain, (mult(i(X1),mult(X1,X2))=X2)). % 1.66/0.59 cnf(i_0_45, plain, (asoc(X1,X2,asoc(X3,X4,X5))=unit)). % 1.66/0.59 cnf(i_0_44, plain, (asoc(asoc(X1,X2,X3),X4,X5)=unit)). % 1.66/0.59 cnf(i_0_28, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))). % 1.66/0.59 cnf(i_0_34, plain, (mult(mult(X1,X2),op_k(X2,X1))=mult(X2,X1))). % 1.66/0.59 cnf(i_0_32, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 1.66/0.59 cnf(i_0_33, plain, (mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3))=mult(mult(X1,X2),X3))). % 1.66/0.59 cnf(i_0_41, plain, (rd(mult(mult(mult(i(X1),mult(X2,X1)),X3),X4),mult(X3,X4))=mult(i(X1),mult(rd(mult(mult(X2,X3),X4),mult(X3,X4)),X1)))). % 1.66/0.59 cnf(i_0_39, plain, (rd(mult(mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X3))),X4),X5),mult(X4,X5))=mult(i(mult(X1,X2)),mult(X1,mult(X2,rd(mult(mult(X3,X4),X5),mult(X4,X5))))))). % 1.66/0.59 cnf(i_0_43, plain, (mult(i(X1),mult(mult(i(X2),mult(X3,X2)),X1))=mult(i(X2),mult(mult(i(X1),mult(X3,X1)),X2)))). % 1.66/0.59 cnf(i_0_42, plain, (mult(i(X1),mult(mult(i(mult(X2,X3)),mult(X2,mult(X3,X4))),X1))=mult(i(mult(X2,X3)),mult(X2,mult(X3,mult(i(X1),mult(X4,X1))))))). % 1.66/0.59 cnf(i_0_38, plain, (rd(mult(mult(rd(mult(mult(X1,X2),X3),mult(X2,X3)),X4),X5),mult(X4,X5))=rd(mult(mult(rd(mult(mult(X1,X4),X5),mult(X4,X5)),X2),X3),mult(X2,X3)))). % 1.66/0.59 cnf(i_0_40, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(mult(X3,X4)),mult(X3,mult(X4,X5))))))=mult(i(mult(X3,X4)),mult(X3,mult(X4,mult(i(mult(X1,X2)),mult(X1,mult(X2,X5)))))))). % 1.66/0.59 cnf(i_0_46, negated_conjecture, (op_k(op_k(a,b),c)!=unit)). % 1.66/0.59 cnf(i_0_48, plain, (X6=X6)). % 1.66/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.66/0.59 # Begin printing tableau % 1.66/0.59 # Found 7 steps % 1.66/0.59 cnf(i_0_25, plain, (mult(X5,unit)=X5), inference(start_rule)). % 1.66/0.59 cnf(i_0_57, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_55])). % 1.66/0.59 cnf(i_0_94, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_25])). % 1.66/0.59 cnf(i_0_96, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_25])). % 1.66/0.59 cnf(i_0_93, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=asoc(X3,X5,X7)), inference(extension_rule, [i_0_51])). % 1.66/0.59 cnf(i_0_106, plain, (asoc(X3,X5,X7)!=mult(asoc(X3,X5,X7),unit)), inference(closure_rule, [i_0_25])). % 1.66/0.59 cnf(i_0_104, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=mult(asoc(X3,X5,X7),unit)), inference(etableau_closure_rule, [i_0_104, ...])). % 1.66/0.59 # End printing tableau % 1.66/0.59 # SZS output end % 1.66/0.59 # Branches closed with saturation will be marked with an "s" % 1.66/0.59 # Child (11956) has found a proof. % 1.66/0.59 % 1.66/0.59 # Proof search is over... % 1.66/0.59 # Freeing feature tree %------------------------------------------------------------------------------