TSTP Solution File: LAT388+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:48:17 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 100 ( 2 equ)
% Maximal formula atoms : 48 ( 12 avg)
% Number of connectives : 134 ( 42 ~; 46 |; 37 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1330,hypothesis,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(xp,X1) )
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1330) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,hypothesis,
! [X3,X4] :
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ( aElementOf0(esk4_1(X4),xT)
| ~ aElementOf0(X4,xS)
| sdtlseqdt0(xp,X4) )
& ( ~ sdtlseqdt0(esk4_1(X4),X4)
| ~ aElementOf0(X4,xS)
| sdtlseqdt0(xp,X4) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| sdtlseqdt0(xp,X4) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(distribute,[status(thm)],[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)],[m__1330])])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X4,X7,X4] :
( ( aElementOf0(esk6_1(X4),xS)
| aElementOf0(esk5_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk6_1(X4))
| aElementOf0(esk5_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( aUpperBoundOfIn0(esk6_1(X4),xT,xS)
| aElementOf0(esk5_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ sdtlseqdt0(X4,esk6_1(X4))
| aElementOf0(esk5_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( aElementOf0(esk6_1(X4),xS)
| ~ sdtlseqdt0(esk5_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk6_1(X4))
| ~ sdtlseqdt0(esk5_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( aUpperBoundOfIn0(esk6_1(X4),xT,xS)
| ~ sdtlseqdt0(esk5_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ sdtlseqdt0(X4,esk6_1(X4))
| ~ sdtlseqdt0(esk5_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS) )
& ( aElementOf0(esk6_1(X4),xS)
| ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk6_1(X4))
| ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS) )
& ( aUpperBoundOfIn0(esk6_1(X4),xT,xS)
| ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS) )
& ( ~ sdtlseqdt0(X4,esk6_1(X4))
| ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS) )
& ~ aSupremumOfIn0(X4,xT,xS) ),
inference(distribute,[status(thm)],[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)],[c_0_2])])])])])])]) ).
cnf(c_0_5,hypothesis,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n023.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 11:49:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.024 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 8
% 0.23/1.41 # Proof object clause steps : 3
% 0.23/1.41 # Proof object formula steps : 5
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 2
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 0
% 0.23/1.41 # Proof object simplifying inferences : 1
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 31
% 0.23/1.41 # Removed by relevancy pruning/SinE : 7
% 0.23/1.41 # Initial clauses : 122
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 120
% 0.23/1.41 # Processed clauses : 24
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 24
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 3
% 0.23/1.41 # ...of the previous two non-trivial : 2
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 2
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 22
% 0.23/1.41 # Positive orientable unit clauses : 16
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 5
% 0.23/1.41 # Current number of unprocessed clauses: 98
% 0.23/1.41 # ...number of literals in the above : 325
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 10
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 7
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 16
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 7123
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.022 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.025 s
% 0.23/1.41 # Maximum resident set size: 3292 pages
%------------------------------------------------------------------------------