TSTP Solution File: LAT300+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT300+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:26:42 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 171 ( 67 ~; 62 |; 25 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 75 ( 2 sgn 36 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_m2_lattice4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_lattice4) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3)) )
=> m1_subset_1(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(dt_m2_filter_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( ~ v1_xboole_0(X2)
& m2_lattice4(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_filter_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(t24_filter_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
& r2_hidden(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_filter_2) ).
fof(rc1_subset_1,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ? [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_subset_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(c_0_8,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_lattice4]) ).
fof(c_0_9,plain,
! [X13,X14,X15] :
( ~ r2_hidden(X13,X14)
| ~ m1_subset_1(X14,k1_zfmisc_1(X15))
| m1_subset_1(X13,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_10,plain,
! [X42,X43] :
( v3_struct_0(X42)
| ~ v10_lattices(X42)
| ~ l3_lattices(X42)
| ~ m2_lattice4(X43,X42)
| m1_subset_1(X43,k1_zfmisc_1(u1_struct_0(X42))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( ~ v1_xboole_0(X2)
& m2_lattice4(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_filter_2]) ).
cnf(c_0_12,plain,
( m1_subset_1(X1,X3)
| ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( v3_struct_0(X1)
| m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v10_lattices(X1)
| ~ l3_lattices(X1)
| ~ m2_lattice4(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X30,X31] :
( ( ~ v1_xboole_0(X31)
| ~ m2_filter_2(X31,X30)
| v3_struct_0(X30)
| ~ v10_lattices(X30)
| ~ l3_lattices(X30) )
& ( m2_lattice4(X31,X30)
| ~ m2_filter_2(X31,X30)
| v3_struct_0(X30)
| ~ v10_lattices(X30)
| ~ l3_lattices(X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_15,plain,
( m1_subset_1(X1,u1_struct_0(X2))
| v3_struct_0(X2)
| ~ m2_lattice4(X3,X2)
| ~ r2_hidden(X1,X3)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( m2_lattice4(X1,X2)
| v3_struct_0(X2)
| ~ m2_filter_2(X1,X2)
| ~ v10_lattices(X2)
| ~ l3_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X11,X12] :
( ~ m1_subset_1(X11,X12)
| v1_xboole_0(X12)
| r2_hidden(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
& r2_hidden(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t24_filter_2])]) ).
fof(c_0_19,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ? [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2) ) ),
inference(fof_simplification,[status(thm)],[rc1_subset_1]) ).
cnf(c_0_20,plain,
( m1_subset_1(X1,u1_struct_0(X2))
| v3_struct_0(X2)
| ~ r2_hidden(X1,X3)
| ~ m2_filter_2(X3,X2)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( v1_xboole_0(X2)
| r2_hidden(X1,X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( v3_struct_0(X2)
| ~ v1_xboole_0(X1)
| ~ m2_filter_2(X1,X2)
| ~ v10_lattices(X2)
| ~ l3_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,negated_conjecture,
! [X6] :
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& l3_lattices(esk1_0)
& m2_filter_2(esk2_0,esk1_0)
& ( ~ m1_subset_1(X6,u1_struct_0(esk1_0))
| ~ r2_hidden(X6,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
fof(c_0_24,plain,
! [X23] :
( ( m1_subset_1(esk4_1(X23),k1_zfmisc_1(X23))
| v1_xboole_0(X23) )
& ( ~ v1_xboole_0(esk4_1(X23))
| v1_xboole_0(X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])]) ).
cnf(c_0_25,plain,
( m1_subset_1(X1,u1_struct_0(X2))
| v3_struct_0(X2)
| ~ m1_subset_1(X1,X3)
| ~ m2_filter_2(X3,X2)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X9,X10] :
( ~ r2_hidden(X9,X10)
| m1_subset_1(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_31,plain,
( m1_subset_1(esk4_1(X1),k1_zfmisc_1(X1))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ m1_subset_1(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_34,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( v1_xboole_0(X1)
| m1_subset_1(X2,X1)
| ~ r2_hidden(X2,esk4_1(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_36,plain,
( v1_xboole_0(X1)
| ~ v1_xboole_0(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X21] : m1_subset_1(esk3_1(X21),X21),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_38,negated_conjecture,
~ r2_hidden(X1,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_40,plain,
( v1_xboole_0(X1)
| m1_subset_1(X2,X1)
| ~ m1_subset_1(X2,esk4_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_36]) ).
cnf(c_0_41,plain,
m1_subset_1(esk3_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ m1_subset_1(X1,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_21]),c_0_39]) ).
cnf(c_0_43,plain,
( v1_xboole_0(X1)
| m1_subset_1(esk3_1(esk4_1(X1)),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT300+1 : TPTP v8.2.0. Released v3.4.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 20:13:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_1 with pid 19926 completed with status 0
% 0.19/0.49 # Result found by new_bool_1
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSS-FFMM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 19929 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSS-FFMM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 44
% 0.19/0.49 # Removed by relevancy pruning/SinE : 20
% 0.19/0.49 # Initial clauses : 34
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 34
% 0.19/0.49 # Processed clauses : 140
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 21
% 0.19/0.49 # ...remaining for further processing : 119
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 14
% 0.19/0.49 # Backward-rewritten : 3
% 0.19/0.49 # Generated clauses : 114
% 0.19/0.49 # ...of the previous two non-redundant : 102
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 7
% 0.19/0.49 # Paramodulations : 114
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 19
% 0.19/0.49 # ...of those cached : 12
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 68
% 0.19/0.49 # Positive orientable unit clauses : 10
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 7
% 0.19/0.49 # Non-unit-clauses : 51
% 0.19/0.49 # Current number of unprocessed clauses: 21
% 0.19/0.49 # ...number of literals in the above : 94
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 51
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 775
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 312
% 0.19/0.49 # Non-unit clause-clause subsumptions : 35
% 0.19/0.49 # Unit Clause-clause subsumption calls : 30
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 4478
% 0.19/0.49 # Search garbage collected termcells : 511
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.015 s
% 0.19/0.49 # Maximum resident set size: 1864 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.015 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.019 s
% 0.19/0.49 # Maximum resident set size: 1752 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------