%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT392-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 : 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 : Sun Jul 17 04:51:58 EDT 2022 % Result : Unsatisfiable 16.52s 8.60s % Output : CNFRefutation 16.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : LAT392-1 : TPTP v8.1.0. Released v4.0.0. % 0.00/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.32 % Computer : n028.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % 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 29 14:40:43 EDT 2022 % 0.12/0.33 % CPUTime : % 0.17/0.35 # No SInE strategy applied % 0.17/0.35 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.17/0.35 # and selection function SelectMaxLComplexAvoidPosPred. % 0.17/0.35 # % 0.17/0.35 # Number of axioms: 2 Number of unprocessed: 2 % 0.17/0.35 # Tableaux proof search. % 0.17/0.35 # APR header successfully linked. % 0.17/0.35 # Hello from C++ % 0.17/0.36 # The folding up rule is enabled... % 0.17/0.36 # Local unification is enabled... % 0.17/0.36 # Any saturation attempts will use folding labels... % 0.17/0.36 # 2 beginning clauses after preprocessing and clausification % 0.17/0.36 # Creating start rules for all 1 conjectures. % 0.17/0.36 # There are 1 start rule candidates: % 0.17/0.36 # Found 2 unit axioms. % 0.17/0.36 # 1 start rule tableaux created. % 0.17/0.36 # 0 extension rule candidate clauses % 0.17/0.36 # 2 unit axiom clauses % 0.17/0.36 % 0.17/0.36 # Requested 8, 32 cores available to the main process. % 0.17/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.17/0.36 # Creating equality axioms % 0.17/0.36 # Ran out of tableaux, making start rules for all clauses % 0.17/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.17/0.36 # We now have 9 tableaux to operate on % 16.52/8.60 # There were 1 total branch saturation attempts. % 16.52/8.60 # There were 0 of these attempts blocked. % 16.52/8.60 # There were 0 deferred branch saturation attempts. % 16.52/8.60 # There were 0 free duplicated saturations. % 16.52/8.60 # There were 1 total successful branch saturations. % 16.52/8.60 # There were 0 successful branch saturations in interreduction. % 16.52/8.60 # There were 0 successful branch saturations on the branch. % 16.52/8.60 # There were 1 successful branch saturations after the branch. % 16.52/8.60 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.52/8.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.52/8.60 # Begin clausification derivation % 16.52/8.60 % 16.52/8.60 # End clausification derivation % 16.52/8.60 # Begin listing active clauses obtained from FOF to CNF conversion % 16.52/8.60 cnf(i_0_4, negated_conjecture, (plus(plus(mult(a,b),mult(b,c)),b)!=b)). % 16.52/8.60 cnf(i_0_3, plain, (mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3)))=X2)). % 16.52/8.60 cnf(i_0_6, plain, (X9=X9)). % 16.52/8.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 16.52/8.60 # Begin printing tableau % 16.52/8.60 # Found 6 steps % 16.52/8.60 cnf(i_0_3, plain, (mult(plus(mult(plus(X1,b),plus(b,mult(X1,b))),X3),plus(mult(plus(X1,mult(mult(plus(X4,b),plus(b,X5)),b)),plus(mult(plus(b,plus(plus(mult(X4,mult(b,X5)),mult(X6,b)),b)),plus(X7,mult(b,plus(plus(mult(b,X8),mult(X6,b)),b)))),mult(X1,mult(mult(plus(X4,b),plus(b,X5)),b)))),mult(mult(plus(X1,b),plus(b,mult(X1,b))),X3)))=b), inference(start_rule)). % 16.52/8.60 cnf(i_0_13, plain, (mult(plus(mult(plus(X1,b),plus(b,mult(X1,b))),X3),plus(mult(plus(X1,mult(mult(plus(X4,b),plus(b,X5)),b)),plus(mult(plus(b,plus(plus(mult(X4,mult(b,X5)),mult(X6,b)),b)),plus(X7,mult(b,plus(plus(mult(b,X8),mult(X6,b)),b)))),mult(X1,mult(mult(plus(X4,b),plus(b,X5)),b)))),mult(mult(plus(X1,b),plus(b,mult(X1,b))),X3)))=b), inference(extension_rule, [i_0_9])). % 16.52/8.60 cnf(i_0_136, plain, (plus(plus(mult(a,b),mult(b,c)),b)=b), inference(closure_rule, [i_0_4])). % 16.52/8.60 cnf(i_0_137, plain, (plus(plus(mult(a,b),mult(b,c)),b)!=mult(plus(mult(plus(X1,b),plus(b,mult(X1,b))),X3),plus(mult(plus(X1,mult(mult(plus(X4,b),plus(b,X5)),b)),plus(mult(plus(b,plus(plus(mult(X4,mult(b,X5)),mult(X6,b)),b)),plus(X7,mult(b,plus(plus(mult(b,X8),mult(X6,b)),b)))),mult(X1,mult(mult(plus(X4,b),plus(b,X5)),b)))),mult(mult(plus(X1,b),plus(b,mult(X1,b))),X3)))), inference(extension_rule, [i_0_9])). % 16.52/8.60 cnf(i_0_150, plain, (plus(plus(mult(a,b),mult(b,c)),b)!=mult(plus(mult(plus(X1,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),mult(X1,plus(plus(mult(a,b),mult(b,c)),b)))),X3),plus(mult(plus(X1,mult(mult(plus(X4,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),X5)),plus(plus(mult(a,b),mult(b,c)),b))),plus(mult(plus(plus(plus(mult(a,b),mult(b,c)),b),plus(plus(mult(X4,mult(plus(plus(mult(a,b),mult(b,c)),b),X5)),mult(X6,plus(plus(mult(a,b),mult(b,c)),b))),plus(plus(mult(a,b),mult(b,c)),b))),plus(X7,mult(plus(plus(mult(a,b),mult(b,c)),b),plus(plus(mult(plus(plus(mult(a,b),mult(b,c)),b),X8),mult(X6,plus(plus(mult(a,b),mult(b,c)),b))),plus(plus(mult(a,b),mult(b,c)),b))))),mult(X1,mult(mult(plus(X4,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),X5)),plus(plus(mult(a,b),mult(b,c)),b))))),mult(mult(plus(X1,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),mult(X1,plus(plus(mult(a,b),mult(b,c)),b)))),X3)))), inference(closure_rule, [i_0_3])). % 16.52/8.60 cnf(i_0_151, plain, (mult(plus(mult(plus(X1,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),mult(X1,plus(plus(mult(a,b),mult(b,c)),b)))),X3),plus(mult(plus(X1,mult(mult(plus(X4,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),X5)),plus(plus(mult(a,b),mult(b,c)),b))),plus(mult(plus(plus(plus(mult(a,b),mult(b,c)),b),plus(plus(mult(X4,mult(plus(plus(mult(a,b),mult(b,c)),b),X5)),mult(X6,plus(plus(mult(a,b),mult(b,c)),b))),plus(plus(mult(a,b),mult(b,c)),b))),plus(X7,mult(plus(plus(mult(a,b),mult(b,c)),b),plus(plus(mult(plus(plus(mult(a,b),mult(b,c)),b),X8),mult(X6,plus(plus(mult(a,b),mult(b,c)),b))),plus(plus(mult(a,b),mult(b,c)),b))))),mult(X1,mult(mult(plus(X4,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),X5)),plus(plus(mult(a,b),mult(b,c)),b))))),mult(mult(plus(X1,plus(plus(mult(a,b),mult(b,c)),b)),plus(plus(plus(mult(a,b),mult(b,c)),b),mult(X1,plus(plus(mult(a,b),mult(b,c)),b)))),X3)))!=mult(plus(mult(plus(X1,b),plus(b,mult(X1,b))),X3),plus(mult(plus(X1,mult(mult(plus(X4,b),plus(b,X5)),b)),plus(mult(plus(b,plus(plus(mult(X4,mult(b,X5)),mult(X6,b)),b)),plus(X7,mult(b,plus(plus(mult(b,X8),mult(X6,b)),b)))),mult(X1,mult(mult(plus(X4,b),plus(b,X5)),b)))),mult(mult(plus(X1,b),plus(b,mult(X1,b))),X3)))), inference(etableau_closure_rule, [i_0_151, ...])). % 16.52/8.60 # End printing tableau % 16.52/8.60 # SZS output end % 16.52/8.60 # Branches closed with saturation will be marked with an "s" % 16.70/8.63 # Child (14781) has found a proof. % 16.70/8.63 % 16.70/8.63 # Proof search is over... % 16.70/8.63 # Freeing feature tree %------------------------------------------------------------------------------