TSTP Solution File: LAT292+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT292+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 18:08:22 EDT 2023
% Result : Theorem 576.11s 89.75s
% Output : CNFRefutation 576.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 180 ( 4 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 234 ( 82 ~; 79 |; 63 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn; 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t44_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ? [X2] :
( ~ v3_struct_0(X2)
& v2_pre_topc(X2)
& l1_pre_topc(X2)
& r1_filter_1(X1,k6_lopclset(X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p',t44_lopclset) ).
fof(d9_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p',d9_lopclset) ).
fof(t43_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> r1_filter_1(X1,k12_lopclset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p',t43_lopclset) ).
fof(dt_k11_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ( v1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1))
& l1_pre_topc(k11_lopclset(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p',dt_k11_lopclset) ).
fof(fc4_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ( ~ v3_struct_0(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p',fc4_lopclset) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ? [X2] :
( ~ v3_struct_0(X2)
& v2_pre_topc(X2)
& l1_pre_topc(X2)
& r1_filter_1(X1,k6_lopclset(X2)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t44_lopclset])]) ).
fof(c_0_6,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[d9_lopclset]) ).
fof(c_0_7,negated_conjecture,
! [X53] :
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& v17_lattices(esk1_0)
& ~ v3_realset2(esk1_0)
& l3_lattices(esk1_0)
& ( v3_struct_0(X53)
| ~ v2_pre_topc(X53)
| ~ l1_pre_topc(X53)
| ~ r1_filter_1(esk1_0,k6_lopclset(X53)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X85] :
( v3_struct_0(X85)
| ~ v10_lattices(X85)
| ~ v17_lattices(X85)
| v3_realset2(X85)
| ~ l3_lattices(X85)
| k12_lopclset(X85) = k6_lopclset(k11_lopclset(X85)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> r1_filter_1(X1,k12_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t43_lopclset]) ).
fof(c_0_10,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ( v1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1))
& l1_pre_topc(k11_lopclset(X1)) ) ),
inference(fof_simplification,[status(thm)],[dt_k11_lopclset]) ).
fof(c_0_11,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ( ~ v3_struct_0(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc4_lopclset]) ).
cnf(c_0_12,negated_conjecture,
( v3_struct_0(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ r1_filter_1(esk1_0,k6_lopclset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( v3_struct_0(X1)
| v3_realset2(X1)
| k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1))
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X72] :
( v3_struct_0(X72)
| ~ v10_lattices(X72)
| ~ v17_lattices(X72)
| v3_realset2(X72)
| ~ l3_lattices(X72)
| r1_filter_1(X72,k12_lopclset(X72)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_15,plain,
! [X1769] :
( ( v1_pre_topc(k11_lopclset(X1769))
| v3_struct_0(X1769)
| ~ v10_lattices(X1769)
| ~ v17_lattices(X1769)
| v3_realset2(X1769)
| ~ l3_lattices(X1769) )
& ( v2_pre_topc(k11_lopclset(X1769))
| v3_struct_0(X1769)
| ~ v10_lattices(X1769)
| ~ v17_lattices(X1769)
| v3_realset2(X1769)
| ~ l3_lattices(X1769) )
& ( l1_pre_topc(k11_lopclset(X1769))
| v3_struct_0(X1769)
| ~ v10_lattices(X1769)
| ~ v17_lattices(X1769)
| v3_realset2(X1769)
| ~ l3_lattices(X1769) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X1770] :
( ( ~ v3_struct_0(k11_lopclset(X1770))
| v3_struct_0(X1770)
| ~ v10_lattices(X1770)
| ~ v17_lattices(X1770)
| v3_realset2(X1770)
| ~ l3_lattices(X1770) )
& ( v1_pre_topc(k11_lopclset(X1770))
| v3_struct_0(X1770)
| ~ v10_lattices(X1770)
| ~ v17_lattices(X1770)
| v3_realset2(X1770)
| ~ l3_lattices(X1770) )
& ( v2_pre_topc(k11_lopclset(X1770))
| v3_struct_0(X1770)
| ~ v10_lattices(X1770)
| ~ v17_lattices(X1770)
| v3_realset2(X1770)
| ~ l3_lattices(X1770) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,negated_conjecture,
( v3_struct_0(k11_lopclset(X1))
| v3_realset2(X1)
| v3_struct_0(X1)
| ~ r1_filter_1(esk1_0,k12_lopclset(X1))
| ~ v2_pre_topc(k11_lopclset(X1))
| ~ l1_pre_topc(k11_lopclset(X1))
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| ~ l3_lattices(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( v3_struct_0(X1)
| v3_realset2(X1)
| r1_filter_1(X1,k12_lopclset(X1))
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( v2_pre_topc(k11_lopclset(X1))
| v3_struct_0(X1)
| v3_realset2(X1)
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( l1_pre_topc(k11_lopclset(X1))
| v3_struct_0(X1)
| v3_realset2(X1)
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( v3_struct_0(X1)
| v3_realset2(X1)
| ~ v3_struct_0(k11_lopclset(X1))
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ v3_realset2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
v17_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_17,c_0_18,c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 3.76/3.87 % Problem : LAT292+4 : TPTP v8.1.2. Released v3.4.0.
% 3.86/3.88 % Command : run_E %s %d THM
% 3.87/4.09 % Computer : n022.cluster.edu
% 3.87/4.09 % Model : x86_64 x86_64
% 3.87/4.09 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 3.87/4.09 % Memory : 8042.1875MB
% 3.87/4.09 % OS : Linux 3.10.0-693.el7.x86_64
% 3.87/4.09 % CPULimit : 2400
% 3.87/4.09 % WCLimit : 300
% 3.87/4.09 % DateTime : Mon Oct 2 10:06:02 EDT 2023
% 3.87/4.09 % CPUTime :
% 17.28/17.59 Running first-order theorem proving
% 17.28/17.59 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.CF9V4aCiqM/E---3.1_29667.p
% 576.11/89.75 # Version: 3.1pre001
% 576.11/89.75 # Preprocessing class: FMLLMLLLSSSNFFN.
% 576.11/89.75 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 576.11/89.75 # Starting new_bool_3 with 897s (3) cores
% 576.11/89.75 # Starting new_bool_1 with 897s (3) cores
% 576.11/89.75 # Starting sh5l with 299s (1) cores
% 576.11/89.75 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 576.11/89.75 # sh5l with pid 29750 completed with status 0
% 576.11/89.75 # Result found by sh5l
% 576.11/89.75 # Preprocessing class: FMLLMLLLSSSNFFN.
% 576.11/89.75 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 576.11/89.75 # Starting new_bool_3 with 897s (3) cores
% 576.11/89.75 # Starting new_bool_1 with 897s (3) cores
% 576.11/89.75 # Starting sh5l with 299s (1) cores
% 576.11/89.75 # SinE strategy is gf500_gu_R04_F100_L20000
% 576.11/89.75 # Search class: FGHSM-SMLM32-DFFFFFNN
% 576.11/89.75 # Scheduled 13 strats onto 1 cores with 291 seconds (291 total)
% 576.11/89.75 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 22s (1) cores
% 576.11/89.75 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 29762 completed with status 7
% 576.11/89.75 # Starting sh5l with 30s (1) cores
% 576.11/89.75 # sh5l with pid 29811 completed with status 7
% 576.11/89.75 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 22s (1) cores
% 576.11/89.75 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 30507 completed with status 0
% 576.11/89.75 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 576.11/89.75 # Preprocessing class: FMLLMLLLSSSNFFN.
% 576.11/89.75 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 576.11/89.75 # Starting new_bool_3 with 897s (3) cores
% 576.11/89.75 # Starting new_bool_1 with 897s (3) cores
% 576.11/89.75 # Starting sh5l with 299s (1) cores
% 576.11/89.75 # SinE strategy is gf500_gu_R04_F100_L20000
% 576.11/89.75 # Search class: FGHSM-SMLM32-DFFFFFNN
% 576.11/89.75 # Scheduled 13 strats onto 1 cores with 291 seconds (291 total)
% 576.11/89.75 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 22s (1) cores
% 576.11/89.75 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 29762 completed with status 7
% 576.11/89.75 # Starting sh5l with 30s (1) cores
% 576.11/89.75 # sh5l with pid 29811 completed with status 7
% 576.11/89.75 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 22s (1) cores
% 576.11/89.75 # Preprocessing time : 1.304 s
% 576.11/89.75 # SatCheck found unsatisfiable ground set
% 576.11/89.75
% 576.11/89.75 # Proof found!
% 576.11/89.75 # SZS status Theorem
% 576.11/89.75 # SZS output start CNFRefutation
% See solution above
% 576.11/89.75 # Parsed axioms : 32179
% 576.11/89.75 # Removed by relevancy pruning/SinE : 16006
% 576.11/89.75 # Initial clauses : 48373
% 576.11/89.75 # Removed in clause preprocessing : 1076
% 576.11/89.75 # Initial clauses in saturation : 47297
% 576.11/89.75 # Processed clauses : 11299
% 576.11/89.75 # ...of these trivial : 400
% 576.11/89.75 # ...subsumed : 899
% 576.11/89.75 # ...remaining for further processing : 10000
% 576.11/89.75 # Other redundant clauses eliminated : 620
% 576.11/89.75 # Clauses deleted for lack of memory : 0
% 576.11/89.75 # Backward-subsumed : 8
% 576.11/89.75 # Backward-rewritten : 49
% 576.11/89.75 # Generated clauses : 184291
% 576.11/89.75 # ...of the previous two non-redundant : 175238
% 576.11/89.75 # ...aggressively subsumed : 0
% 576.11/89.75 # Contextual simplify-reflections : 171
% 576.11/89.75 # Paramodulations : 183675
% 576.11/89.75 # Factorizations : 3
% 576.11/89.75 # NegExts : 0
% 576.11/89.75 # Equation resolutions : 648
% 576.11/89.75 # Total rewrite steps : 26851
% 576.11/89.75 # Propositional unsat checks : 2
% 576.11/89.75 # Propositional check models : 0
% 576.11/89.75 # Propositional check unsatisfiable : 1
% 576.11/89.75 # Propositional clauses : 220879
% 576.11/89.75 # Propositional clauses after purity: 34539
% 576.11/89.75 # Propositional unsat core size : 10
% 576.11/89.75 # Propositional preprocessing time : 0.000
% 576.11/89.75 # Propositional encoding time : 0.993
% 576.11/89.75 # Propositional solver time : 0.252
% 576.11/89.75 # Success case prop preproc time : 0.000
% 576.11/89.75 # Success case prop encoding time : 0.675
% 576.11/89.75 # Success case prop solver time : 0.076
% 576.11/89.75 # Current number of processed clauses : 9643
% 576.11/89.75 # Positive orientable unit clauses : 2415
% 576.11/89.75 # Positive unorientable unit clauses: 9
% 576.11/89.75 # Negative unit clauses : 331
% 576.11/89.75 # Non-unit-clauses : 6888
% 576.11/89.75 # Current number of unprocessed clauses: 211236
% 576.11/89.75 # ...number of literals in the above : 1037884
% 576.11/89.75 # Current number of archived formulas : 0
% 576.11/89.75 # Current number of archived clauses : 57
% 576.11/89.75 # Clause-clause subsumption calls (NU) : 12675782
% 576.11/89.75 # Rec. Clause-clause subsumption calls : 4335552
% 576.11/89.75 # Non-unit clause-clause subsumptions : 1011
% 576.11/89.75 # Unit Clause-clause subsumption calls : 687261
% 576.11/89.75 # Rewrite failures with RHS unbound : 0
% 576.11/89.75 # BW rewrite match attempts : 284
% 576.11/89.75 # BW rewrite match successes : 162
% 576.11/89.75 # Condensation attempts : 0
% 576.11/89.75 # Condensation successes : 0
% 576.11/89.75 # Termbank termtop insertions : 10151973
% 576.11/89.75
% 576.11/89.75 # -------------------------------------------------
% 576.11/89.75 # User time : 68.599 s
% 576.11/89.75 # System time : 1.308 s
% 576.11/89.75 # Total time : 69.906 s
% 576.11/89.75 # Maximum resident set size: 223108 pages
% 576.11/89.75
% 576.11/89.75 # -------------------------------------------------
% 576.11/89.75 # User time : 70.138 s
% 576.11/89.75 # System time : 1.382 s
% 576.11/89.75 # Total time : 71.520 s
% 576.11/89.75 # Maximum resident set size: 49620 pages
% 576.11/89.75 % E---3.1 exiting
% 576.11/89.76 % E---3.1 exiting
%------------------------------------------------------------------------------