TSTP Solution File: LAT292+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT292+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:21 EDT 2023
% Result : Theorem 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 177 ( 4 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 229 ( 80 ~; 76 |; 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.Zt5skZ1ooC/E---3.1_26060.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.Zt5skZ1ooC/E---3.1_26060.p',d9_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.Zt5skZ1ooC/E---3.1_26060.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.Zt5skZ1ooC/E---3.1_26060.p',fc4_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.Zt5skZ1ooC/E---3.1_26060.p',t43_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,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_8,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]) ).
fof(c_0_9,negated_conjecture,
! [X8] :
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& v17_lattices(esk1_0)
& ~ v3_realset2(esk1_0)
& l3_lattices(esk1_0)
& ( v3_struct_0(X8)
| ~ v2_pre_topc(X8)
| ~ l1_pre_topc(X8)
| ~ r1_filter_1(esk1_0,k6_lopclset(X8)) ) ),
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_10,plain,
! [X14] :
( v3_struct_0(X14)
| ~ v10_lattices(X14)
| ~ v17_lattices(X14)
| v3_realset2(X14)
| ~ l3_lattices(X14)
| k12_lopclset(X14) = k6_lopclset(k11_lopclset(X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_11,plain,
! [X19] :
( ( v1_pre_topc(k11_lopclset(X19))
| v3_struct_0(X19)
| ~ v10_lattices(X19)
| ~ v17_lattices(X19)
| v3_realset2(X19)
| ~ l3_lattices(X19) )
& ( v2_pre_topc(k11_lopclset(X19))
| v3_struct_0(X19)
| ~ v10_lattices(X19)
| ~ v17_lattices(X19)
| v3_realset2(X19)
| ~ l3_lattices(X19) )
& ( l1_pre_topc(k11_lopclset(X19))
| v3_struct_0(X19)
| ~ v10_lattices(X19)
| ~ v17_lattices(X19)
| v3_realset2(X19)
| ~ l3_lattices(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X20] :
( ( ~ v3_struct_0(k11_lopclset(X20))
| v3_struct_0(X20)
| ~ v10_lattices(X20)
| ~ v17_lattices(X20)
| v3_realset2(X20)
| ~ l3_lattices(X20) )
& ( v1_pre_topc(k11_lopclset(X20))
| v3_struct_0(X20)
| ~ v10_lattices(X20)
| ~ v17_lattices(X20)
| v3_realset2(X20)
| ~ l3_lattices(X20) )
& ( v2_pre_topc(k11_lopclset(X20))
| v3_struct_0(X20)
| ~ v10_lattices(X20)
| ~ v17_lattices(X20)
| v3_realset2(X20)
| ~ l3_lattices(X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,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]) ).
cnf(c_0_14,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_9]) ).
cnf(c_0_15,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_10]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,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_11]) ).
cnf(c_0_18,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_12]) ).
fof(c_0_19,plain,
! [X13] :
( v3_struct_0(X13)
| ~ v10_lattices(X13)
| ~ v17_lattices(X13)
| v3_realset2(X13)
| ~ l3_lattices(X13)
| r1_filter_1(X13,k12_lopclset(X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
( v3_realset2(X1)
| v3_struct_0(X1)
| ~ r1_filter_1(esk1_0,k12_lopclset(X1))
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_21,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_19]) ).
cnf(c_0_22,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
v17_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ v3_realset2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[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
% 0.13/0.15 % Problem : LAT292+1 : TPTP v8.1.2. Released v3.4.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n013.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 10:25:14 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.Zt5skZ1ooC/E---3.1_26060.p
% 0.23/0.59 # Version: 3.1pre001
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 # Starting sh5l with 300s (1) cores
% 0.23/0.59 # new_bool_1 with pid 26155 completed with status 0
% 0.23/0.59 # Result found by new_bool_1
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 # Search class: FGUSF-FFMM11-SFFFFFNN
% 0.23/0.59 # partial match(1): FGUSF-FFMM21-SFFFFFNN
% 0.23/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.59 # SAT001_MinMin_p005000_rr_RG with pid 26158 completed with status 0
% 0.23/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 # Search class: FGUSF-FFMM11-SFFFFFNN
% 0.23/0.59 # partial match(1): FGUSF-FFMM21-SFFFFFNN
% 0.23/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.59 # Preprocessing time : 0.004 s
% 0.23/0.59 # Presaturation interreduction done
% 0.23/0.59
% 0.23/0.59 # Proof found!
% 0.23/0.59 # SZS status Theorem
% 0.23/0.59 # SZS output start CNFRefutation
% See solution above
% 0.23/0.59 # Parsed axioms : 112
% 0.23/0.59 # Removed by relevancy pruning/SinE : 99
% 0.23/0.59 # Initial clauses : 30
% 0.23/0.59 # Removed in clause preprocessing : 0
% 0.23/0.59 # Initial clauses in saturation : 30
% 0.23/0.59 # Processed clauses : 63
% 0.23/0.59 # ...of these trivial : 0
% 0.23/0.59 # ...subsumed : 5
% 0.23/0.59 # ...remaining for further processing : 58
% 0.23/0.59 # Other redundant clauses eliminated : 0
% 0.23/0.59 # Clauses deleted for lack of memory : 0
% 0.23/0.59 # Backward-subsumed : 1
% 0.23/0.59 # Backward-rewritten : 0
% 0.23/0.59 # Generated clauses : 10
% 0.23/0.59 # ...of the previous two non-redundant : 9
% 0.23/0.59 # ...aggressively subsumed : 0
% 0.23/0.59 # Contextual simplify-reflections : 3
% 0.23/0.59 # Paramodulations : 10
% 0.23/0.59 # Factorizations : 0
% 0.23/0.59 # NegExts : 0
% 0.23/0.59 # Equation resolutions : 0
% 0.23/0.59 # Total rewrite steps : 4
% 0.23/0.59 # Propositional unsat checks : 0
% 0.23/0.59 # Propositional check models : 0
% 0.23/0.59 # Propositional check unsatisfiable : 0
% 0.23/0.59 # Propositional clauses : 0
% 0.23/0.59 # Propositional clauses after purity: 0
% 0.23/0.59 # Propositional unsat core size : 0
% 0.23/0.59 # Propositional preprocessing time : 0.000
% 0.23/0.59 # Propositional encoding time : 0.000
% 0.23/0.59 # Propositional solver time : 0.000
% 0.23/0.59 # Success case prop preproc time : 0.000
% 0.23/0.59 # Success case prop encoding time : 0.000
% 0.23/0.59 # Success case prop solver time : 0.000
% 0.23/0.59 # Current number of processed clauses : 29
% 0.23/0.59 # Positive orientable unit clauses : 10
% 0.23/0.59 # Positive unorientable unit clauses: 0
% 0.23/0.59 # Negative unit clauses : 3
% 0.23/0.59 # Non-unit-clauses : 16
% 0.23/0.59 # Current number of unprocessed clauses: 2
% 0.23/0.59 # ...number of literals in the above : 18
% 0.23/0.59 # Current number of archived formulas : 0
% 0.23/0.59 # Current number of archived clauses : 29
% 0.23/0.59 # Clause-clause subsumption calls (NU) : 81
% 0.23/0.59 # Rec. Clause-clause subsumption calls : 9
% 0.23/0.59 # Non-unit clause-clause subsumptions : 9
% 0.23/0.59 # Unit Clause-clause subsumption calls : 4
% 0.23/0.59 # Rewrite failures with RHS unbound : 0
% 0.23/0.59 # BW rewrite match attempts : 0
% 0.23/0.59 # BW rewrite match successes : 0
% 0.23/0.59 # Condensation attempts : 0
% 0.23/0.59 # Condensation successes : 0
% 0.23/0.59 # Termbank termtop insertions : 4191
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.005 s
% 0.23/0.59 # System time : 0.006 s
% 0.23/0.59 # Total time : 0.011 s
% 0.23/0.59 # Maximum resident set size: 2080 pages
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.008 s
% 0.23/0.59 # System time : 0.009 s
% 0.23/0.59 # Total time : 0.017 s
% 0.23/0.59 # Maximum resident set size: 1808 pages
% 0.23/0.59 % E---3.1 exiting
% 0.23/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------