%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM012+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 : n029.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 : Fri Jul 15 01:14:56 EDT 2022 % Result : Theorem 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : COM012+1 : TPTP v8.1.0. Released v4.0.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.14/0.34 % Computer : n029.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Thu Jun 16 19:50:42 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 17 Number of unprocessed: 17 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 17 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 3 conjectures. % 0.14/0.38 # There are 3 start rule candidates: % 0.14/0.38 # Found 7 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 3 start rule tableaux created. % 0.14/0.38 # 10 extension rule candidate clauses % 0.14/0.38 # 7 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.38 # Creating equality axioms % 0.14/0.38 # Ran out of tableaux, making start rules for all clauses % 0.14/0.38 # Returning from population with 36 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 36 tableaux to operate on % 0.14/0.39 # There were 4 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 4 total successful branch saturations. % 0.14/0.39 # There were 3 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx))). % 0.14/0.39 cnf(i_0_21, negated_conjecture, (sdtmndtasgtdt0(xx,xR,xy))). % 0.14/0.39 cnf(i_0_20, negated_conjecture, (sdtmndtasgtdt0(xy,xR,xz))). % 0.14/0.39 cnf(i_0_16, hypothesis, (aElement0(xy))). % 0.14/0.39 cnf(i_0_15, hypothesis, (aElement0(xz))). % 0.14/0.39 cnf(i_0_17, hypothesis, (aRewritingSystem0(xR))). % 0.14/0.39 cnf(i_0_19, negated_conjecture, (~sdtmndtasgtdt0(xx,xR,xz))). % 0.14/0.39 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_10, plain, (aReductOfIn0(X1,X2,X3)|aElement0(esk1_3(X2,X3,X1))|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_9, plain, (aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_8, plain, (sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_450, plain, (X20=X20)). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 16 steps % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx)), inference(start_rule)). % 0.14/0.39 cnf(i_0_459, plain, (aElement0(xx)), inference(extension_rule, [i_0_454])). % 0.14/0.39 cnf(i_0_581, plain, ($false), inference(extension_rule, [i_0_451])). % 0.14/0.39 cnf(i_0_1284, plain, ($false), inference(extension_rule, [i_0_14])). % 0.14/0.39 cnf(i_0_1300, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_1301, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_580, plain, (aElement0(xx)), inference(extension_rule, [i_0_13])). % 0.14/0.39 cnf(i_0_1308, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_1307, plain, (sdtmndtasgtdt0(xx,xR,xx)), inference(extension_rule, [i_0_458])). % 0.14/0.39 cnf(i_0_1361, plain, (sdtmndtasgtdt0(xx,xR,xz)), inference(closure_rule, [i_0_19])). % 0.14/0.39 cnf(i_0_1362, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_1363, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_1298, plain, (sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_1298, ...])). % 0.14/0.39 cnf(i_0_1299, plain, (~sdtmndtasgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_1299, ...])). % 0.14/0.39 cnf(i_0_1302, plain, (~aElement0(xx)), inference(etableau_closure_rule, [i_0_1302, ...])). % 0.14/0.39 cnf(i_0_1364, plain, (xx!=xz), inference(etableau_closure_rule, [i_0_1364, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 1 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx))). % 0.14/0.39 cnf(i_0_21, negated_conjecture, (sdtmndtasgtdt0(xx,xR,xy))). % 0.14/0.39 cnf(i_0_20, negated_conjecture, (sdtmndtasgtdt0(xy,xR,xz))). % 0.14/0.39 cnf(i_0_16, hypothesis, (aElement0(xy))). % 0.14/0.39 cnf(i_0_15, hypothesis, (aElement0(xz))). % 0.14/0.39 cnf(i_0_17, hypothesis, (aRewritingSystem0(xR))). % 0.14/0.39 cnf(i_0_19, negated_conjecture, (~sdtmndtasgtdt0(xx,xR,xz))). % 0.14/0.39 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_10, plain, (aReductOfIn0(X1,X2,X3)|aElement0(esk1_3(X2,X3,X1))|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_9, plain, (aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_8, plain, (sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_450, plain, (X20=X20)). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 16 steps % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx)), inference(start_rule)). % 0.14/0.39 cnf(i_0_459, plain, (aElement0(xx)), inference(extension_rule, [i_0_11])). % 0.14/0.39 cnf(i_0_557, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_558, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_559, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_554, plain, (sdtmndtplgtdt0(xx,xR,xx)), inference(extension_rule, [i_0_457])). % 0.14/0.39 cnf(i_0_673, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_674, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_555, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_555, ...])). % 0.14/0.39 cnf(i_0_556, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_556, ...])). % 0.14/0.39 cnf(i_0_672, plain, (sdtmndtplgtdt0(xx,xR,xz)), inference(extension_rule, [i_0_12])). % 0.14/0.39 cnf(i_0_711, plain, (sdtmndtasgtdt0(xx,xR,xz)), inference(closure_rule, [i_0_19])). % 0.14/0.39 cnf(i_0_713, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_714, plain, (~aElement0(xz)), inference(closure_rule, [i_0_15])). % 0.14/0.39 cnf(i_0_715, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_675, plain, (xx!=xz), inference(etableau_closure_rule, [i_0_675, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 1 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx))). % 0.14/0.39 cnf(i_0_21, negated_conjecture, (sdtmndtasgtdt0(xx,xR,xy))). % 0.14/0.39 cnf(i_0_20, negated_conjecture, (sdtmndtasgtdt0(xy,xR,xz))). % 0.14/0.39 cnf(i_0_16, hypothesis, (aElement0(xy))). % 0.14/0.39 cnf(i_0_15, hypothesis, (aElement0(xz))). % 0.14/0.39 cnf(i_0_17, hypothesis, (aRewritingSystem0(xR))). % 0.14/0.39 cnf(i_0_19, negated_conjecture, (~sdtmndtasgtdt0(xx,xR,xz))). % 0.14/0.39 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_10, plain, (aReductOfIn0(X1,X2,X3)|aElement0(esk1_3(X2,X3,X1))|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_9, plain, (aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_8, plain, (sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_450, plain, (X20=X20)). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 16 steps % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx)), inference(start_rule)). % 0.14/0.39 cnf(i_0_459, plain, (aElement0(xx)), inference(extension_rule, [i_0_11])). % 0.14/0.39 cnf(i_0_557, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_558, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_560, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_554, plain, (sdtmndtplgtdt0(xx,xR,xx)), inference(extension_rule, [i_0_457])). % 0.14/0.39 cnf(i_0_673, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_674, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_555, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_555, ...])). % 0.14/0.39 cnf(i_0_556, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_556, ...])). % 0.14/0.39 cnf(i_0_672, plain, (sdtmndtplgtdt0(xx,xR,xz)), inference(extension_rule, [i_0_12])). % 0.14/0.39 cnf(i_0_711, plain, (sdtmndtasgtdt0(xx,xR,xz)), inference(closure_rule, [i_0_19])). % 0.14/0.39 cnf(i_0_713, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_714, plain, (~aElement0(xz)), inference(closure_rule, [i_0_15])). % 0.14/0.39 cnf(i_0_715, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_675, plain, (xx!=xz), inference(etableau_closure_rule, [i_0_675, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 1 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx))). % 0.14/0.39 cnf(i_0_21, negated_conjecture, (sdtmndtasgtdt0(xx,xR,xy))). % 0.14/0.39 cnf(i_0_20, negated_conjecture, (sdtmndtasgtdt0(xy,xR,xz))). % 0.14/0.39 cnf(i_0_16, hypothesis, (aElement0(xy))). % 0.14/0.39 cnf(i_0_15, hypothesis, (aElement0(xz))). % 0.14/0.39 cnf(i_0_17, hypothesis, (aRewritingSystem0(xR))). % 0.14/0.39 cnf(i_0_19, negated_conjecture, (~sdtmndtasgtdt0(xx,xR,xz))). % 0.14/0.39 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_10, plain, (aReductOfIn0(X1,X2,X3)|aElement0(esk1_3(X2,X3,X1))|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.14/0.39 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_9, plain, (aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_8, plain, (sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.14/0.39 cnf(i_0_450, plain, (X20=X20)). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 16 steps % 0.14/0.39 cnf(i_0_18, hypothesis, (aElement0(xx)), inference(start_rule)). % 0.14/0.39 cnf(i_0_459, plain, (aElement0(xx)), inference(extension_rule, [i_0_11])). % 0.14/0.39 cnf(i_0_557, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_559, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_560, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_554, plain, (sdtmndtplgtdt0(xx,xR,xx)), inference(extension_rule, [i_0_457])). % 0.14/0.39 cnf(i_0_673, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_674, plain, ($false), inference(closure_rule, [i_0_450])). % 0.14/0.39 cnf(i_0_555, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_555, ...])). % 0.14/0.39 cnf(i_0_556, plain, (~sdtmndtplgtdt0(xx,xR,xx)), inference(etableau_closure_rule, [i_0_556, ...])). % 0.14/0.39 cnf(i_0_672, plain, (sdtmndtplgtdt0(xx,xR,xz)), inference(extension_rule, [i_0_12])). % 0.14/0.39 cnf(i_0_711, plain, (sdtmndtasgtdt0(xx,xR,xz)), inference(closure_rule, [i_0_19])). % 0.14/0.39 cnf(i_0_713, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_714, plain, (~aElement0(xz)), inference(closure_rule, [i_0_15])). % 0.14/0.39 cnf(i_0_715, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_675, plain, (xx!=xz), inference(etableau_closure_rule, [i_0_675, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (7589) has found a proof. % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------