TSTP Solution File: LAT300+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT300+3 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:26:42 EDT 2024
% Result : Theorem 2.64s 1.37s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 142 ( 51 ~; 43 |; 27 &)
% ( 4 <=>; 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 : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 50 ( 0 sgn 31 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
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/sandbox2/benchmark/theBenchmark.p',dt_m2_filter_2) ).
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/sandbox2/benchmark/theBenchmark.p',t24_filter_2) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',existence_m1_subset_1) ).
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/sandbox2/benchmark/Axioms/SET007/SET007+375.ax',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/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t4_subset) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_7,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]) ).
fof(c_0_8,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_9,plain,
! [X29,X30] :
( ( ~ m1_subset_1(X30,X29)
| r2_hidden(X30,X29)
| v1_xboole_0(X29) )
& ( ~ r2_hidden(X30,X29)
| m1_subset_1(X30,X29)
| v1_xboole_0(X29) )
& ( ~ m1_subset_1(X30,X29)
| v1_xboole_0(X30)
| ~ v1_xboole_0(X29) )
& ( ~ v1_xboole_0(X30)
| m1_subset_1(X30,X29)
| ~ v1_xboole_0(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
! [X70] : m1_subset_1(esk8_1(X70),X70),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_11,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_12,plain,
! [X72,X73] :
( ( ~ v1_xboole_0(X73)
| ~ m2_filter_2(X73,X72)
| v3_struct_0(X72)
| ~ v10_lattices(X72)
| ~ l3_lattices(X72) )
& ( m2_lattice4(X73,X72)
| ~ m2_filter_2(X73,X72)
| v3_struct_0(X72)
| ~ v10_lattices(X72)
| ~ l3_lattices(X72) ) ),
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_7])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X17] :
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& l3_lattices(esk1_0)
& m2_filter_2(esk2_0,esk1_0)
& ( ~ m1_subset_1(X17,u1_struct_0(esk1_0))
| ~ r2_hidden(X17,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_8])])])])]) ).
fof(c_0_14,plain,
! [X46,X47,X48] :
( ~ r2_hidden(X46,X47)
| ~ m1_subset_1(X47,k1_zfmisc_1(X48))
| m1_subset_1(X46,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_15,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
m1_subset_1(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X121,X122] :
( v3_struct_0(X121)
| ~ v10_lattices(X121)
| ~ l3_lattices(X121)
| ~ m2_lattice4(X122,X121)
| m1_subset_1(X122,k1_zfmisc_1(u1_struct_0(X121))) ),
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_18,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_12]) ).
cnf(c_0_19,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,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_12]) ).
cnf(c_0_24,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_14]) ).
cnf(c_0_25,plain,
( v1_xboole_0(X1)
| r2_hidden(esk8_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,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_17]) ).
cnf(c_0_27,negated_conjecture,
m2_lattice4(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,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_23,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_30,plain,
( m1_subset_1(esk8_1(X1),X2)
| v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_32,negated_conjecture,
~ m1_subset_1(esk8_1(esk2_0),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LAT300+3 : TPTP v8.2.0. Released v3.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 20:11:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/benchmark/theBenchmark.p
% 2.64/1.37 # Version: 3.1.0
% 2.64/1.37 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.64/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/1.37 # Starting new_bool_3 with 900s (3) cores
% 2.64/1.37 # Starting new_bool_1 with 900s (3) cores
% 2.64/1.37 # Starting sh5l with 300s (1) cores
% 2.64/1.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.64/1.37 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 16821 completed with status 0
% 2.64/1.37 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 2.64/1.37 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.64/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/1.37 # Starting new_bool_3 with 900s (3) cores
% 2.64/1.37 # Starting new_bool_1 with 900s (3) cores
% 2.64/1.37 # Starting sh5l with 300s (1) cores
% 2.64/1.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.64/1.37 # SinE strategy is gf120_gu_R02_F100_L20000
% 2.64/1.37 # Search class: FGHSS-FSLM31-MFFFFFNN
% 2.64/1.37 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 2.64/1.37 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.64/1.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 2.64/1.37 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16825 completed with status 0
% 2.64/1.37 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.64/1.37 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.64/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/1.37 # Starting new_bool_3 with 900s (3) cores
% 2.64/1.37 # Starting new_bool_1 with 900s (3) cores
% 2.64/1.37 # Starting sh5l with 300s (1) cores
% 2.64/1.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.64/1.37 # SinE strategy is gf120_gu_R02_F100_L20000
% 2.64/1.37 # Search class: FGHSS-FSLM31-MFFFFFNN
% 2.64/1.37 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 2.64/1.37 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.64/1.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 2.64/1.37 # Preprocessing time : 0.010 s
% 2.64/1.37 # Presaturation interreduction done
% 2.64/1.37
% 2.64/1.37 # Proof found!
% 2.64/1.37 # SZS status Theorem
% 2.64/1.37 # SZS output start CNFRefutation
% See solution above
% 2.64/1.37 # Parsed axioms : 13607
% 2.64/1.37 # Removed by relevancy pruning/SinE : 13546
% 2.64/1.37 # Initial clauses : 191
% 2.64/1.37 # Removed in clause preprocessing : 0
% 2.64/1.37 # Initial clauses in saturation : 191
% 2.64/1.37 # Processed clauses : 865
% 2.64/1.37 # ...of these trivial : 0
% 2.64/1.37 # ...subsumed : 373
% 2.64/1.37 # ...remaining for further processing : 492
% 2.64/1.37 # Other redundant clauses eliminated : 0
% 2.64/1.37 # Clauses deleted for lack of memory : 0
% 2.64/1.37 # Backward-subsumed : 1
% 2.64/1.37 # Backward-rewritten : 5
% 2.64/1.37 # Generated clauses : 2711
% 2.64/1.37 # ...of the previous two non-redundant : 2582
% 2.64/1.37 # ...aggressively subsumed : 0
% 2.64/1.37 # Contextual simplify-reflections : 26
% 2.64/1.37 # Paramodulations : 2709
% 2.64/1.37 # Factorizations : 2
% 2.64/1.37 # NegExts : 0
% 2.64/1.37 # Equation resolutions : 0
% 2.64/1.37 # Disequality decompositions : 0
% 2.64/1.37 # Total rewrite steps : 110
% 2.64/1.37 # ...of those cached : 91
% 2.64/1.37 # Propositional unsat checks : 0
% 2.64/1.37 # Propositional check models : 0
% 2.64/1.37 # Propositional check unsatisfiable : 0
% 2.64/1.37 # Propositional clauses : 0
% 2.64/1.37 # Propositional clauses after purity: 0
% 2.64/1.37 # Propositional unsat core size : 0
% 2.64/1.37 # Propositional preprocessing time : 0.000
% 2.64/1.37 # Propositional encoding time : 0.000
% 2.64/1.37 # Propositional solver time : 0.000
% 2.64/1.37 # Success case prop preproc time : 0.000
% 2.64/1.37 # Success case prop encoding time : 0.000
% 2.64/1.37 # Success case prop solver time : 0.000
% 2.64/1.37 # Current number of processed clauses : 297
% 2.64/1.37 # Positive orientable unit clauses : 23
% 2.64/1.37 # Positive unorientable unit clauses: 0
% 2.64/1.37 # Negative unit clauses : 30
% 2.64/1.37 # Non-unit-clauses : 244
% 2.64/1.37 # Current number of unprocessed clauses: 2071
% 2.64/1.37 # ...number of literals in the above : 8961
% 2.64/1.37 # Current number of archived formulas : 0
% 2.64/1.37 # Current number of archived clauses : 195
% 2.64/1.37 # Clause-clause subsumption calls (NU) : 32218
% 2.64/1.37 # Rec. Clause-clause subsumption calls : 11572
% 2.64/1.37 # Non-unit clause-clause subsumptions : 188
% 2.64/1.37 # Unit Clause-clause subsumption calls : 538
% 2.64/1.37 # Rewrite failures with RHS unbound : 0
% 2.64/1.37 # BW rewrite match attempts : 3
% 2.64/1.37 # BW rewrite match successes : 3
% 2.64/1.37 # Condensation attempts : 0
% 2.64/1.37 # Condensation successes : 0
% 2.64/1.37 # Termbank termtop insertions : 386153
% 2.64/1.37 # Search garbage collected termcells : 120092
% 2.64/1.37
% 2.64/1.37 # -------------------------------------------------
% 2.64/1.37 # User time : 0.234 s
% 2.64/1.37 # System time : 0.047 s
% 2.64/1.37 # Total time : 0.282 s
% 2.64/1.37 # Maximum resident set size: 25956 pages
% 2.64/1.37
% 2.64/1.37 # -------------------------------------------------
% 2.64/1.37 # User time : 0.830 s
% 2.64/1.37 # System time : 0.079 s
% 2.64/1.37 # Total time : 0.909 s
% 2.64/1.37 # Maximum resident set size: 20012 pages
% 2.64/1.37 % E---3.1 exiting
%------------------------------------------------------------------------------