TSTP Solution File: NUM550+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:42 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 53 ( 25 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 23 ~; 14 |; 17 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 1 sgn 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefEmp) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCardEmpty) ).
fof(m__2270,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2270) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2202_02) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| X3 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,xQ)
& xQ = slcrc0 ),
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)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X2] :
( ( sbrdtbr0(X2) != sz00
| X2 = slcrc0
| ~ aSet0(X2) )
& ( X2 != slcrc0
| sbrdtbr0(X2) = sz00
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
cnf(c_0_9,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X2] :
( aSet0(xQ)
& ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
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__2270])])])])]) ).
cnf(c_0_12,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( aSet0(X1)
| X1 != xQ ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( sbrdtbr0(X1) = sz00
| X1 != xQ ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
cnf(c_0_16,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[m__2202_02]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 17:07:29 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.023 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 18
% 0.25/1.43 # Proof object clause steps : 8
% 0.25/1.43 # Proof object formula steps : 10
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 5
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 1
% 0.25/1.43 # Proof object simplifying inferences : 4
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 67
% 0.25/1.43 # Removed by relevancy pruning/SinE : 5
% 0.25/1.43 # Initial clauses : 141
% 0.25/1.43 # Removed in clause preprocessing : 5
% 0.25/1.43 # Initial clauses in saturation : 136
% 0.25/1.43 # Processed clauses : 35
% 0.25/1.43 # ...of these trivial : 3
% 0.25/1.43 # ...subsumed : 2
% 0.25/1.43 # ...remaining for further processing : 30
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 8
% 0.25/1.43 # ...of the previous two non-trivial : 6
% 0.25/1.43 # Contextual simplify-reflections : 1
% 0.25/1.43 # Paramodulations : 8
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 30
% 0.25/1.43 # Positive orientable unit clauses : 17
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 3
% 0.25/1.43 # Non-unit-clauses : 10
% 0.25/1.43 # Current number of unprocessed clauses: 107
% 0.25/1.43 # ...number of literals in the above : 422
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 10
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 9
% 0.25/1.43 # Non-unit clause-clause subsumptions : 2
% 0.25/1.43 # Unit Clause-clause subsumption calls : 6
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 9011
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.020 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.024 s
% 0.25/1.43 # Maximum resident set size: 3296 pages
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------