TSTP Solution File: LAT300+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT300+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : 600s
% DateTime : Sun Jul 17 04:46:40 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 110 ( 44 ~; 39 |; 17 &)
% ( 0 <=>; 10 =>; 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 : 45 ( 2 sgn 25 !; 3 ?)
% 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_m2_lattice4) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_filter_2) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_1) ).
fof(c_0_6,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3)
| ~ m2_lattice4(X4,X3)
| m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_m2_lattice4])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ( ~ v1_xboole_0(X4)
| ~ m2_filter_2(X4,X3)
| v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3) )
& ( m2_lattice4(X4,X3)
| ~ m2_filter_2(X4,X3)
| v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[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(assume_negation,[status(cth)],[t24_filter_2]) ).
cnf(c_0_9,plain,
( m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| v3_struct_0(X2)
| ~ m2_lattice4(X1,X2)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( v3_struct_0(X1)
| m2_lattice4(X2,X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m2_filter_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ r2_hidden(X4,X5)
| ~ m1_subset_1(X5,k1_zfmisc_1(X6))
| m1_subset_1(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
cnf(c_0_13,plain,
( m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| v3_struct_0(X2)
| ~ m2_filter_2(X1,X2)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( m1_subset_1(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,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_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| ~ m1_subset_1(X1,u1_struct_0(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ m1_subset_1(X3,X4)
| v1_xboole_0(X4)
| r2_hidden(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_22,plain,
( v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m2_filter_2(X2,X1)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ r2_hidden(X1,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,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_14]),c_0_15]),c_0_16])]),c_0_17]) ).
fof(c_0_26,plain,
! [X3] : m1_subset_1(esk3_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_27,negated_conjecture,
~ m1_subset_1(X1,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
m1_subset_1(esk3_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT300+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 29 14:37:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.017 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 30
% 0.22/1.41 # Proof object clause steps : 17
% 0.22/1.41 # Proof object formula steps : 13
% 0.22/1.41 # Proof object conjectures : 13
% 0.22/1.41 # Proof object clause conjectures : 10
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 11
% 0.22/1.41 # Proof object initial formulas used : 6
% 0.22/1.41 # Proof object generating inferences : 6
% 0.22/1.41 # Proof object simplifying inferences : 10
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 44
% 0.22/1.41 # Removed by relevancy pruning/SinE : 20
% 0.22/1.41 # Initial clauses : 34
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 34
% 0.22/1.41 # Processed clauses : 63
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 2
% 0.22/1.41 # ...remaining for further processing : 61
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 56
% 0.22/1.41 # ...of the previous two non-trivial : 48
% 0.22/1.41 # Contextual simplify-reflections : 3
% 0.22/1.41 # Paramodulations : 56
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 58
% 0.22/1.41 # Positive orientable unit clauses : 11
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 10
% 0.22/1.41 # Non-unit-clauses : 37
% 0.22/1.41 # Current number of unprocessed clauses: 16
% 0.22/1.41 # ...number of literals in the above : 65
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 3
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 199
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 94
% 0.22/1.41 # Non-unit clause-clause subsumptions : 6
% 0.22/1.41 # Unit Clause-clause subsumption calls : 40
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 3042
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.016 s
% 0.22/1.41 # System time : 0.005 s
% 0.22/1.41 # Total time : 0.021 s
% 0.22/1.41 # Maximum resident set size: 3020 pages
%------------------------------------------------------------------------------