TSTP Solution File: NUM544+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM544+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : Mon Jul 18 09:33:37 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 85 ( 3 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 101 ( 34 ~; 28 |; 24 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 24 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ~ ( ~ ? [X1] : aElementOf0(X1,xS)
| xS = slcrc0 )
=> ( ( aElementOf0(szmzazxdt0(xS),xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,szmzazxdt0(xS)) ) )
=> ( ( aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ! [X1] :
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
<=> ( aElementOf0(X1,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS))) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSuccLess) ).
fof(m__1986,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1986) ).
fof(c_0_3,negated_conjecture,
~ ( ~ ( ~ ? [X1] : aElementOf0(X1,xS)
| xS = slcrc0 )
=> ( ( aElementOf0(szmzazxdt0(xS),xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,szmzazxdt0(xS)) ) )
=> ( ( aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ! [X1] :
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
<=> ( aElementOf0(X1,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS))) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X3,X4,X4] :
( aElementOf0(esk1_0,xS)
& xS != slcrc0
& aElementOf0(szmzazxdt0(xS),xS)
& ( ~ aElementOf0(X3,xS)
| sdtlseqdt0(X3,szmzazxdt0(xS)) )
& aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ( aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X4,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
& ( sdtlseqdt0(szszuzczcdt0(X4),szszuzczcdt0(szmzazxdt0(xS)))
| ~ aElementOf0(X4,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
& ( ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X4),szszuzczcdt0(szmzazxdt0(xS)))
| aElementOf0(X4,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
& aElementOf0(esk2_0,xS)
& ~ aElementOf0(esk2_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ~ aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(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_3])])])])])])]) ).
fof(c_0_5,plain,
! [X3,X4] :
( ( ~ sdtlseqdt0(X3,X4)
| sdtlseqdt0(szszuzczcdt0(X3),szszuzczcdt0(X4))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ sdtlseqdt0(szszuzczcdt0(X3),szszuzczcdt0(X4))
| sdtlseqdt0(X3,X4)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])]) ).
cnf(c_0_6,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS)))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( sdtlseqdt0(szszuzczcdt0(X2),szszuzczcdt0(X1))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,hypothesis,
! [X2] :
( aSet0(xS)
& ( ~ aElementOf0(X2,xS)
| aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
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)],[m__1986])])])])]) ).
cnf(c_0_9,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ sdtlseqdt0(X1,szmzazxdt0(xS))
| ~ aElementOf0(szmzazxdt0(xS),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( sdtlseqdt0(X1,szmzazxdt0(xS))
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(esk2_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ aElementOf0(szmzazxdt0(xS),szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
aElementOf0(esk2_0,xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
aElementOf0(szmzazxdt0(xS),xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM544+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 5 02:43:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.023 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 18
% 0.26/1.43 # Proof object clause steps : 11
% 0.26/1.43 # Proof object formula steps : 7
% 0.26/1.43 # Proof object conjectures : 11
% 0.26/1.43 # Proof object clause conjectures : 8
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 7
% 0.26/1.43 # Proof object initial formulas used : 3
% 0.26/1.43 # Proof object generating inferences : 4
% 0.26/1.43 # Proof object simplifying inferences : 5
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 56
% 0.26/1.43 # Removed by relevancy pruning/SinE : 4
% 0.26/1.43 # Initial clauses : 105
% 0.26/1.43 # Removed in clause preprocessing : 5
% 0.26/1.43 # Initial clauses in saturation : 100
% 0.26/1.43 # Processed clauses : 135
% 0.26/1.43 # ...of these trivial : 1
% 0.26/1.43 # ...subsumed : 13
% 0.26/1.43 # ...remaining for further processing : 121
% 0.26/1.43 # Other redundant clauses eliminated : 11
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 0
% 0.26/1.43 # Generated clauses : 332
% 0.26/1.43 # ...of the previous two non-trivial : 289
% 0.26/1.43 # Contextual simplify-reflections : 17
% 0.26/1.43 # Paramodulations : 310
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 22
% 0.26/1.43 # Current number of processed clauses : 118
% 0.26/1.43 # Positive orientable unit clauses : 16
% 0.26/1.43 # Positive unorientable unit clauses: 0
% 0.26/1.43 # Negative unit clauses : 6
% 0.26/1.43 # Non-unit-clauses : 96
% 0.26/1.43 # Current number of unprocessed clauses: 254
% 0.26/1.43 # ...number of literals in the above : 1333
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 0
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 1991
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 542
% 0.26/1.43 # Non-unit clause-clause subsumptions : 23
% 0.26/1.43 # Unit Clause-clause subsumption calls : 133
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 0
% 0.26/1.43 # BW rewrite match successes : 0
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 12703
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.039 s
% 0.26/1.43 # System time : 0.002 s
% 0.26/1.43 # Total time : 0.041 s
% 0.26/1.43 # Maximum resident set size: 3512 pages
%------------------------------------------------------------------------------