TSTP Solution File: SEU408+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU408+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:32:00 EDT 2023
% Result : Theorem 92.13s 12.56s
% Output : CNFRefutation 92.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 142 ( 26 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 167 ( 56 ~; 52 |; 45 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 60 ( 5 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',d2_xboole_0) ).
fof(t11_latsum_1,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',t11_latsum_1) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( v1_orders_2(X3)
& l1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',dt_k1_latsum_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',t1_subset) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p',commutativity_k2_xboole_0) ).
fof(c_0_6,plain,
! [X142,X143,X144,X145,X146,X147,X148,X149] :
( ( ~ r2_hidden(X145,X144)
| r2_hidden(X145,X142)
| r2_hidden(X145,X143)
| X144 != k2_xboole_0(X142,X143) )
& ( ~ r2_hidden(X146,X142)
| r2_hidden(X146,X144)
| X144 != k2_xboole_0(X142,X143) )
& ( ~ r2_hidden(X146,X143)
| r2_hidden(X146,X144)
| X144 != k2_xboole_0(X142,X143) )
& ( ~ r2_hidden(esk19_3(X147,X148,X149),X147)
| ~ r2_hidden(esk19_3(X147,X148,X149),X149)
| X149 = k2_xboole_0(X147,X148) )
& ( ~ r2_hidden(esk19_3(X147,X148,X149),X148)
| ~ r2_hidden(esk19_3(X147,X148,X149),X149)
| X149 = k2_xboole_0(X147,X148) )
& ( r2_hidden(esk19_3(X147,X148,X149),X149)
| r2_hidden(esk19_3(X147,X148,X149),X147)
| r2_hidden(esk19_3(X147,X148,X149),X148)
| X149 = k2_xboole_0(X147,X148) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t11_latsum_1])]) ).
fof(c_0_8,plain,
! [X75,X76,X77] :
( ( u1_struct_0(X77) = k2_xboole_0(u1_struct_0(X75),u1_struct_0(X76))
| X77 != k1_latsum_1(X75,X76)
| ~ v1_orders_2(X77)
| ~ l1_orders_2(X77)
| ~ l1_orders_2(X76)
| ~ l1_orders_2(X75) )
& ( u1_orders_2(X77) = k2_xboole_0(k2_xboole_0(u1_orders_2(X75),u1_orders_2(X76)),k7_relset_1(u1_struct_0(X75),u1_struct_0(X75),u1_struct_0(X76),u1_struct_0(X76),u1_orders_2(X75),u1_orders_2(X76)))
| X77 != k1_latsum_1(X75,X76)
| ~ v1_orders_2(X77)
| ~ l1_orders_2(X77)
| ~ l1_orders_2(X76)
| ~ l1_orders_2(X75) )
& ( u1_struct_0(X77) != k2_xboole_0(u1_struct_0(X75),u1_struct_0(X76))
| u1_orders_2(X77) != k2_xboole_0(k2_xboole_0(u1_orders_2(X75),u1_orders_2(X76)),k7_relset_1(u1_struct_0(X75),u1_struct_0(X75),u1_struct_0(X76),u1_struct_0(X76),u1_orders_2(X75),u1_orders_2(X76)))
| X77 = k1_latsum_1(X75,X76)
| ~ v1_orders_2(X77)
| ~ l1_orders_2(X77)
| ~ l1_orders_2(X76)
| ~ l1_orders_2(X75) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])]) ).
fof(c_0_9,plain,
! [X73,X74] :
( ( v1_orders_2(k1_latsum_1(X73,X74))
| ~ l1_orders_2(X73)
| ~ l1_orders_2(X74) )
& ( l1_orders_2(k1_latsum_1(X73,X74))
| ~ l1_orders_2(X73)
| ~ l1_orders_2(X74) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_10,plain,
( r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2)
| X3 != k2_xboole_0(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_orders_2(esk1_0)
& v3_orders_2(esk1_0)
& v4_orders_2(esk1_0)
& v1_lattice3(esk1_0)
& l1_orders_2(esk1_0)
& ~ v3_struct_0(esk2_0)
& v2_orders_2(esk2_0)
& v3_orders_2(esk2_0)
& v4_orders_2(esk2_0)
& v1_lattice3(esk2_0)
& l1_orders_2(esk2_0)
& r2_hidden(esk3_0,u1_struct_0(esk2_0))
& ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))
| X1 != k1_latsum_1(X2,X3)
| ~ v1_orders_2(X1)
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X43,X44] :
( ~ r2_hidden(X43,X44)
| m1_subset_1(X43,X44) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_16,plain,
( r2_hidden(X1,k2_xboole_0(X2,X3))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X1751,X1752] : k2_xboole_0(X1751,X1752) = k2_xboole_0(X1752,X1751),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_21,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( u1_struct_0(k1_latsum_1(esk1_0,X1)) = k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(X1))
| ~ l1_orders_2(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
u1_struct_0(k1_latsum_1(esk1_0,esk2_0)) = k2_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU408+2 : TPTP v8.1.2. Released v3.4.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 09:54:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.60/0.79 Running first-order model finding
% 0.60/0.79 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.WNiw3VIuGI/E---3.1_12825.p
% 92.13/12.56 # Version: 3.1pre001
% 92.13/12.56 # Preprocessing class: FMLMSMLLSSSNFFN.
% 92.13/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.13/12.56 # Starting new_bool_3 with 900s (3) cores
% 92.13/12.56 # Starting new_bool_1 with 900s (3) cores
% 92.13/12.56 # Starting sh5l with 300s (1) cores
% 92.13/12.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 92.13/12.56 # sh5l with pid 12905 completed with status 0
% 92.13/12.56 # Result found by sh5l
% 92.13/12.56 # Preprocessing class: FMLMSMLLSSSNFFN.
% 92.13/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.13/12.56 # Starting new_bool_3 with 900s (3) cores
% 92.13/12.56 # Starting new_bool_1 with 900s (3) cores
% 92.13/12.56 # Starting sh5l with 300s (1) cores
% 92.13/12.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 92.13/12.56 # Search class: FGHSM-SMLM32-MFFFFFNN
% 92.13/12.56 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 92.13/12.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 92.13/12.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 12914 completed with status 0
% 92.13/12.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 92.13/12.56 # Preprocessing class: FMLMSMLLSSSNFFN.
% 92.13/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.13/12.56 # Starting new_bool_3 with 900s (3) cores
% 92.13/12.56 # Starting new_bool_1 with 900s (3) cores
% 92.13/12.56 # Starting sh5l with 300s (1) cores
% 92.13/12.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 92.13/12.56 # Search class: FGHSM-SMLM32-MFFFFFNN
% 92.13/12.56 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 92.13/12.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 92.13/12.56 # Preprocessing time : 0.144 s
% 92.13/12.56 # Presaturation interreduction done
% 92.13/12.56
% 92.13/12.56 # Proof found!
% 92.13/12.56 # SZS status Theorem
% 92.13/12.56 # SZS output start CNFRefutation
% See solution above
% 92.13/12.56 # Parsed axioms : 4448
% 92.13/12.56 # Removed by relevancy pruning/SinE : 1338
% 92.13/12.56 # Initial clauses : 7221
% 92.13/12.56 # Removed in clause preprocessing : 165
% 92.13/12.56 # Initial clauses in saturation : 7056
% 92.13/12.56 # Processed clauses : 26446
% 92.13/12.56 # ...of these trivial : 541
% 92.13/12.56 # ...subsumed : 9596
% 92.13/12.56 # ...remaining for further processing : 16309
% 92.13/12.56 # Other redundant clauses eliminated : 852
% 92.13/12.56 # Clauses deleted for lack of memory : 0
% 92.13/12.56 # Backward-subsumed : 101
% 92.13/12.56 # Backward-rewritten : 381
% 92.13/12.56 # Generated clauses : 92204
% 92.13/12.56 # ...of the previous two non-redundant : 85778
% 92.13/12.56 # ...aggressively subsumed : 0
% 92.13/12.56 # Contextual simplify-reflections : 508
% 92.13/12.56 # Paramodulations : 91403
% 92.13/12.56 # Factorizations : 5
% 92.13/12.56 # NegExts : 0
% 92.13/12.56 # Equation resolutions : 868
% 92.13/12.56 # Total rewrite steps : 35434
% 92.13/12.56 # Propositional unsat checks : 4
% 92.13/12.56 # Propositional check models : 2
% 92.13/12.56 # Propositional check unsatisfiable : 0
% 92.13/12.56 # Propositional clauses : 0
% 92.13/12.56 # Propositional clauses after purity: 0
% 92.13/12.56 # Propositional unsat core size : 0
% 92.13/12.56 # Propositional preprocessing time : 0.000
% 92.13/12.56 # Propositional encoding time : 0.213
% 92.13/12.56 # Propositional solver time : 0.202
% 92.13/12.56 # Success case prop preproc time : 0.000
% 92.13/12.56 # Success case prop encoding time : 0.000
% 92.13/12.56 # Success case prop solver time : 0.000
% 92.13/12.56 # Current number of processed clauses : 8669
% 92.13/12.56 # Positive orientable unit clauses : 3090
% 92.13/12.56 # Positive unorientable unit clauses: 7
% 92.13/12.56 # Negative unit clauses : 2520
% 92.13/12.56 # Non-unit-clauses : 3052
% 92.13/12.56 # Current number of unprocessed clauses: 72557
% 92.13/12.56 # ...number of literals in the above : 158493
% 92.13/12.56 # Current number of archived formulas : 0
% 92.13/12.56 # Current number of archived clauses : 6947
% 92.13/12.56 # Clause-clause subsumption calls (NU) : 20506463
% 92.13/12.56 # Rec. Clause-clause subsumption calls : 1434500
% 92.13/12.56 # Non-unit clause-clause subsumptions : 1408
% 92.13/12.56 # Unit Clause-clause subsumption calls : 2313323
% 92.13/12.56 # Rewrite failures with RHS unbound : 0
% 92.13/12.56 # BW rewrite match attempts : 1639
% 92.13/12.56 # BW rewrite match successes : 503
% 92.13/12.56 # Condensation attempts : 0
% 92.13/12.56 # Condensation successes : 0
% 92.13/12.56 # Termbank termtop insertions : 2174604
% 92.13/12.56
% 92.13/12.56 # -------------------------------------------------
% 92.13/12.56 # User time : 11.264 s
% 92.13/12.56 # System time : 0.162 s
% 92.13/12.56 # Total time : 11.426 s
% 92.13/12.56 # Maximum resident set size: 33288 pages
% 92.13/12.56
% 92.13/12.56 # -------------------------------------------------
% 92.13/12.56 # User time : 11.399 s
% 92.13/12.56 # System time : 0.172 s
% 92.13/12.56 # Total time : 11.571 s
% 92.13/12.56 # Maximum resident set size: 7280 pages
% 92.13/12.56 % E---3.1 exiting
%------------------------------------------------------------------------------