TSTP Solution File: LAT381+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT381+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 : n006.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.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Tue Jun 28 18:55:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.12/0.37 # and selection function SelectNewComplexAHP.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 48 Number of unprocessed: 47
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 47 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 10 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 37 extension rule candidate clauses
% 0.12/0.37 # 10 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.38 # There were 4 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 4 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 4 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_32, hypothesis, (aSet0(xT))).
% 0.18/0.38 cnf(i_0_35, hypothesis, (aSet0(xS))).
% 0.18/0.38 cnf(i_0_50, hypothesis, (aElementOf0(xu,xT))).
% 0.18/0.38 cnf(i_0_42, hypothesis, (aElementOf0(xv,xT))).
% 0.18/0.38 cnf(i_0_33, hypothesis, (aSubsetOf0(xS,xT))).
% 0.18/0.38 cnf(i_0_48, hypothesis, (aUpperBoundOfIn0(xu,xS,xT))).
% 0.18/0.38 cnf(i_0_40, hypothesis, (aUpperBoundOfIn0(xv,xS,xT))).
% 0.18/0.38 cnf(i_0_44, hypothesis, (aSupremumOfIn0(xu,xS,xT))).
% 0.18/0.38 cnf(i_0_36, hypothesis, (aSupremumOfIn0(xv,xS,xT))).
% 0.18/0.38 cnf(i_0_51, negated_conjecture, (xu!=xv)).
% 0.18/0.38 cnf(i_0_5, plain, (~isEmpty0(X1)|~aElementOf0(X2,X1)|~aSet0(X1))).
% 0.18/0.38 cnf(i_0_11, plain, (sdtlseqdt0(X1,X1)|~aElement0(X1))).
% 0.18/0.38 cnf(i_0_34, hypothesis, (aElementOf0(X1,xT)|~aElementOf0(X1,xS))).
% 0.18/0.38 cnf(i_0_9, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_49, hypothesis, (sdtlseqdt0(X1,xu)|~aElementOf0(X1,xS))).
% 0.18/0.38 cnf(i_0_4, plain, (isEmpty0(X1)|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))).
% 0.18/0.38 cnf(i_0_41, hypothesis, (sdtlseqdt0(X1,xv)|~aElementOf0(X1,xS))).
% 0.18/0.38 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_45, hypothesis, (sdtlseqdt0(xu,X1)|~aUpperBoundOfIn0(X1,xS,xT))).
% 0.18/0.38 cnf(i_0_37, hypothesis, (sdtlseqdt0(xv,X1)|~aUpperBoundOfIn0(X1,xS,xT))).
% 0.18/0.38 cnf(i_0_46, hypothesis, (sdtlseqdt0(xu,X1)|~sdtlseqdt0(esk7_1(X1),X1)|~aElementOf0(X1,xT))).
% 0.18/0.38 cnf(i_0_47, hypothesis, (sdtlseqdt0(xu,X1)|aElementOf0(esk7_1(X1),xS)|~aElementOf0(X1,xT))).
% 0.18/0.38 cnf(i_0_38, hypothesis, (sdtlseqdt0(xv,X1)|~sdtlseqdt0(esk8_1(X1),X1)|~aElementOf0(X1,xT))).
% 0.18/0.38 cnf(i_0_39, hypothesis, (sdtlseqdt0(xv,X1)|aElementOf0(esk8_1(X1),xS)|~aElementOf0(X1,xT))).
% 0.18/0.38 cnf(i_0_12, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1))).
% 0.18/0.38 cnf(i_0_8, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_7, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_6, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_17, plain, (aElementOf0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_21, plain, (aElementOf0(X1,X2)|~aUpperBoundOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_26, plain, (aElementOf0(X1,X2)|~aInfimumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_31, plain, (aElementOf0(X1,X2)|~aSupremumOfIn0(X1,X3,X2)|~aSubsetOf0(X3,X2)|~aSet0(X2))).
% 0.18/0.38 cnf(i_0_25, plain, (aLowerBoundOfIn0(X1,X2,X3)|~aInfimumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 0.18/0.38 cnf(i_0_30, plain, (aUpperBoundOfIn0(X1,X2,X3)|~aSupremumOfIn0(X1,X2,X3)|~aSubsetOf0(X2,X3)|~aSet0(X3))).
% 0.18/0.38 cnf(i_0_16, plain, (sdtlseqdt0(X1,X2)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X2,X3)|~aSet0(X4))).
% 0.18/0.38 cnf(i_0_20, plain, (sdtlseqdt0(X1,X2)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aElementOf0(X1,X3)|~aSet0(X4))).
% 0.18/0.38 cnf(i_0_29, plain, (sdtlseqdt0(X1,X2)|~aSupremumOfIn0(X1,X3,X4)|~aUpperBoundOfIn0(X2,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 0.18/0.38 cnf(i_0_13, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))).
% 0.18/0.38 cnf(i_0_24, plain, (sdtlseqdt0(X1,X2)|~aInfimumOfIn0(X2,X3,X4)|~aLowerBoundOfIn0(X1,X3,X4)|~aSubsetOf0(X3,X4)|~aSet0(X4))).
% 0.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 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.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 7 steps
% 0.18/0.38 cnf(i_0_51, negated_conjecture, (xu!=xv), inference(start_rule)).
% 0.18/0.38 cnf(i_0_52, plain, (xu!=xv), inference(extension_rule, [i_0_12])).
% 0.18/0.38 cnf(i_0_90, plain, (~sdtlseqdt0(xv,xu)), inference(extension_rule, [i_0_49])).
% 0.18/0.38 cnf(i_0_91, plain, (~sdtlseqdt0(xu,xv)), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.18/0.38 cnf(i_0_92, plain, (~aElement0(xv)), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.18/0.38 cnf(i_0_93, plain, (~aElement0(xu)), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.18/0.38 cnf(i_0_207, plain, (~aElementOf0(xv,xS)), inference(etableau_closure_rule, [i_0_207, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.38 # We now have 1 tableaux to operate on
% 0.18/0.38 # Found closed tableau during pool population.
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------