%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM012+3 : 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 : n032.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:57 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0. % 0.11/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 : n032.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.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Thu Jun 16 19:37:15 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.34 # No SInE strategy applied % 0.12/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.34 # and selection function SelectUnlessUniqMax. % 0.12/0.34 # % 0.12/0.34 # Presaturation interreduction done % 0.12/0.34 # Number of axioms: 29 Number of unprocessed: 29 % 0.12/0.34 # Tableaux proof search. % 0.12/0.34 # APR header successfully linked. % 0.12/0.34 # Hello from C++ % 0.12/0.34 # The folding up rule is enabled... % 0.12/0.34 # Local unification is enabled... % 0.12/0.34 # Any saturation attempts will use folding labels... % 0.12/0.34 # 29 beginning clauses after preprocessing and clausification % 0.12/0.34 # Creating start rules for all 15 conjectures. % 0.12/0.34 # There are 15 start rule candidates: % 0.12/0.34 # Found 10 unit axioms. % 0.12/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.34 # 15 start rule tableaux created. % 0.12/0.34 # 19 extension rule candidate clauses % 0.12/0.34 # 10 unit axiom clauses % 0.12/0.34 % 0.12/0.34 # Requested 8, 32 cores available to the main process. % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # There were 3 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 3 total successful branch saturations. % 0.12/0.35 # There were 1 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 2 successful branch saturations after the branch. % 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_18, hypothesis, (aElement0(xx))). % 0.12/0.35 cnf(i_0_16, hypothesis, (aElement0(xy))). % 0.12/0.35 cnf(i_0_15, hypothesis, (aElement0(xz))). % 0.12/0.35 cnf(i_0_17, hypothesis, (aRewritingSystem0(xR))). % 0.12/0.35 cnf(i_0_29, negated_conjecture, (sdtmndtasgtdt0(xx,xR,xy))). % 0.12/0.35 cnf(i_0_24, negated_conjecture, (sdtmndtasgtdt0(xy,xR,xz))). % 0.12/0.35 cnf(i_0_23, negated_conjecture, (xx!=xz)). % 0.12/0.35 cnf(i_0_22, negated_conjecture, (~aReductOfIn0(xz,xx,xR))). % 0.12/0.35 cnf(i_0_20, negated_conjecture, (~sdtmndtplgtdt0(xx,xR,xz))). % 0.12/0.35 cnf(i_0_19, negated_conjecture, (~sdtmndtasgtdt0(xx,xR,xz))). % 0.12/0.35 cnf(i_0_21, negated_conjecture, (~sdtmndtplgtdt0(X1,xR,xz)|~aReductOfIn0(X1,xx,xR)|~aElement0(X1))). % 0.12/0.35 cnf(i_0_30, negated_conjecture, (xx=xy|sdtmndtplgtdt0(xx,xR,xy))). % 0.12/0.35 cnf(i_0_25, negated_conjecture, (xz=xy|sdtmndtplgtdt0(xy,xR,xz))). % 0.12/0.35 cnf(i_0_33, negated_conjecture, (xx=xy|aReductOfIn0(xy,xx,xR)|aElement0(esk2_0))). % 0.12/0.35 cnf(i_0_28, negated_conjecture, (xz=xy|aReductOfIn0(xz,xy,xR)|aElement0(esk3_0))). % 0.12/0.35 cnf(i_0_32, negated_conjecture, (xx=xy|aReductOfIn0(esk2_0,xx,xR)|aReductOfIn0(xy,xx,xR))). % 0.12/0.35 cnf(i_0_31, negated_conjecture, (xx=xy|sdtmndtplgtdt0(esk2_0,xR,xy)|aReductOfIn0(xy,xx,xR))). % 0.12/0.35 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.12/0.35 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.12/0.35 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.12/0.35 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.12/0.35 cnf(i_0_27, negated_conjecture, (xz=xy|aReductOfIn0(esk3_0,xy,xR)|aReductOfIn0(xz,xy,xR))). % 0.12/0.35 cnf(i_0_26, negated_conjecture, (xz=xy|sdtmndtplgtdt0(esk3_0,xR,xz)|aReductOfIn0(xz,xy,xR))). % 0.12/0.35 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.12/0.36 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.12/0.36 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.12/0.36 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.12/0.36 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.12/0.36 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.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 9 steps % 0.12/0.36 cnf(i_0_20, negated_conjecture, (~sdtmndtplgtdt0(xx,xR,xz)), inference(start_rule)). % 0.12/0.36 cnf(i_0_61, plain, (~sdtmndtplgtdt0(xx,xR,xz)), inference(extension_rule, [i_0_6])). % 0.12/0.36 cnf(i_0_818, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_17])). % 0.12/0.36 cnf(i_0_819, plain, (~aElement0(xz)), inference(closure_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_820, plain, (~aElement0(xx)), inference(closure_rule, [i_0_18])). % 0.12/0.36 cnf(i_0_816, plain, (~sdtmndtplgtdt0(esk3_0,xR,xz)), inference(extension_rule, [i_0_26])). % 0.12/0.36 cnf(i_0_817, plain, (~aReductOfIn0(esk3_0,xx,xR)), inference(etableau_closure_rule, [i_0_817, ...])). % 0.12/0.36 cnf(i_0_858, plain, (xz=xy), inference(etableau_closure_rule, [i_0_858, ...])). % 0.12/0.36 cnf(i_0_860, plain, (aReductOfIn0(xz,xy,xR)), inference(etableau_closure_rule, [i_0_860, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Child (1202) has found a proof. % 0.12/0.36 % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------