%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT381+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 : n012.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:53 EDT 2022 % Result : Theorem 0.10s 0.28s % Output : CNFRefutation 0.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.07 % Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0. % 0.02/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.25 % Computer : n012.cluster.edu % 0.06/0.25 % Model : x86_64 x86_64 % 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.25 % Memory : 8042.1875MB % 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.25 % CPULimit : 300 % 0.06/0.25 % WCLimit : 600 % 0.06/0.25 % DateTime : Wed Jun 29 19:55:33 EDT 2022 % 0.06/0.25 % CPUTime : % 0.10/0.27 # No SInE strategy applied % 0.10/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN % 0.10/0.27 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.27 # % 0.10/0.27 # Presaturation interreduction done % 0.10/0.27 # Number of axioms: 33 Number of unprocessed: 33 % 0.10/0.27 # Tableaux proof search. % 0.10/0.27 # APR header successfully linked. % 0.10/0.27 # Hello from C++ % 0.10/0.27 # The folding up rule is enabled... % 0.10/0.27 # Local unification is enabled... % 0.10/0.27 # Any saturation attempts will use folding labels... % 0.10/0.27 # 33 beginning clauses after preprocessing and clausification % 0.10/0.27 # Creating start rules for all 1 conjectures. % 0.10/0.27 # There are 1 start rule candidates: % 0.10/0.27 # Found 5 unit axioms. % 0.10/0.27 # 1 start rule tableaux created. % 0.10/0.27 # 28 extension rule candidate clauses % 0.10/0.27 # 5 unit axiom clauses % 0.10/0.27 % 0.10/0.27 # Requested 8, 32 cores available to the main process. % 0.10/0.27 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.28 # There were 5 total branch saturation attempts. % 0.10/0.28 # There were 0 of these attempts blocked. % 0.10/0.28 # There were 0 deferred branch saturation attempts. % 0.10/0.28 # There were 0 free duplicated saturations. % 0.10/0.28 # There were 5 total successful branch saturations. % 0.10/0.28 # There were 0 successful branch saturations in interreduction. % 0.10/0.28 # There were 0 successful branch saturations on the branch. % 0.10/0.28 # There were 5 successful branch saturations after the branch. % 0.10/0.28 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.28 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.28 # Begin clausification derivation % 0.10/0.28 % 0.10/0.28 # End clausification derivation % 0.10/0.28 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.28 cnf(i_0_32, hypothesis, (aSet0(xT))). % 0.10/0.28 cnf(i_0_33, hypothesis, (aSubsetOf0(xS,xT))). % 0.10/0.28 cnf(i_0_35, hypothesis, (aSupremumOfIn0(xu,xS,xT))). % 0.10/0.28 cnf(i_0_34, hypothesis, (aSupremumOfIn0(xv,xS,xT))). % 0.10/0.28 cnf(i_0_36, negated_conjecture, (xv!=xu)). % 0.10/0.28 cnf(i_0_11, plain, (sdtlseqdt0(X1,X1)|~aElement0(X1))). % 0.10/0.28 cnf(i_0_9, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_5, plain, (~isEmpty0(X1)|~aElementOf0(X2,X1)|~aSet0(X1))). % 0.10/0.28 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_17, plain, (aElementOf0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_21, plain, (aElementOf0(X1,X2)|~aUpperBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_4, plain, (isEmpty0(X1)|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))). % 0.10/0.28 cnf(i_0_26, plain, (aElementOf0(X1,X2)|~aInfimumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_31, plain, (aElementOf0(X1,X2)|~aSupremumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_6, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_25, plain, (aLowerBoundOfIn0(X1,X2,X3)|~aInfimumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_12, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1))). % 0.10/0.28 cnf(i_0_7, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_30, plain, (aUpperBoundOfIn0(X1,X2,X3)|~aSupremumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_8, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))). % 0.10/0.28 cnf(i_0_16, plain, (sdtlseqdt0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X2,X3)|~aSet0(X4))). % 0.10/0.28 cnf(i_0_20, plain, (sdtlseqdt0(X1,X2)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X1,X3)|~aSet0(X4))). % 0.10/0.28 cnf(i_0_15, plain, (aLowerBoundOfIn0(X1,X2,X3)|aElementOf0(esk3_3(X3,X2,X1),X2)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_14, plain, (aLowerBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(X1,esk3_3(X3,X2,X1))|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_18, plain, (aUpperBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(esk4_3(X3,X2,X1),X1)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_29, plain, (sdtlseqdt0(X1,X2)|~aSupremumOfIn0(X1,X3,X4)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))). % 0.10/0.28 cnf(i_0_24, plain, (sdtlseqdt0(X1,X2)|~aInfimumOfIn0(X2,X3,X4)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))). % 0.10/0.28 cnf(i_0_13, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.10/0.28 cnf(i_0_19, plain, (aUpperBoundOfIn0(X1,X2,X3)|aElementOf0(esk4_3(X3,X2,X1),X2)|~aSubsetOf0(X2,X3)|~aElementOf0(X1,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_27, plain, (aSupremumOfIn0(X1,X2,X3)|~aUpperBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(X1,esk6_3(X3,X2,X1))|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_22, plain, (aInfimumOfIn0(X1,X2,X3)|~aLowerBoundOfIn0(X1,X2,X3)|~sdtlseqdt0(esk5_3(X3,X2,X1),X1)|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_23, plain, (aInfimumOfIn0(X1,X2,X3)|aLowerBoundOfIn0(esk5_3(X3,X2,X1),X2,X3)|~aLowerBoundOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 cnf(i_0_28, plain, (aSupremumOfIn0(X1,X2,X3)|aUpperBoundOfIn0(esk6_3(X3,X2,X1),X2,X3)|~aUpperBoundOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))). % 0.10/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.28 # Begin printing tableau % 0.10/0.28 # Found 10 steps % 0.10/0.28 cnf(i_0_36, negated_conjecture, (xv!=xu), inference(start_rule)). % 0.10/0.28 cnf(i_0_37, plain, (xv!=xu), inference(extension_rule, [i_0_12])). % 0.10/0.28 cnf(i_0_77, plain, (~sdtlseqdt0(xu,xv)), inference(extension_rule, [i_0_16])). % 0.10/0.28 cnf(i_0_216, plain, (~aSubsetOf0(xS,xT)), inference(closure_rule, [i_0_33])). % 0.10/0.28 cnf(i_0_218, plain, (~aSet0(xT)), inference(closure_rule, [i_0_32])). % 0.10/0.28 cnf(i_0_78, plain, (~sdtlseqdt0(xv,xu)), inference(etableau_closure_rule, [i_0_78, ...])). % 0.10/0.28 cnf(i_0_79, plain, (~aElement0(xu)), inference(etableau_closure_rule, [i_0_79, ...])). % 0.10/0.28 cnf(i_0_80, plain, (~aElement0(xv)), inference(etableau_closure_rule, [i_0_80, ...])). % 0.10/0.28 cnf(i_0_215, plain, (~aLowerBoundOfIn0(xu,xS,xT)), inference(etableau_closure_rule, [i_0_215, ...])). % 0.10/0.28 cnf(i_0_217, plain, (~aElementOf0(xv,xS)), inference(etableau_closure_rule, [i_0_217, ...])). % 0.10/0.28 # End printing tableau % 0.10/0.28 # SZS output end % 0.10/0.28 # Branches closed with saturation will be marked with an "s" % 0.10/0.28 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.10/0.28 # We now have 1 tableaux to operate on % 0.10/0.28 # Found closed tableau during pool population. % 0.10/0.28 # Proof search is over... % 0.10/0.28 # Freeing feature tree %------------------------------------------------------------------------------