TSTP Solution File: COM021+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM021+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : Fri Jul 15 01:14:08 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 94 ( 20 equ)
% Maximal formula atoms : 25 ( 7 avg)
% Number of connectives : 93 ( 12 ~; 39 |; 42 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xb = xd
| aReductOfIn0(xd,xb,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xb,xR)
& sdtmndtplgtdt0(X1,xR,xd) )
| sdtmndtplgtdt0(xb,xR,xd)
| sdtmndtasgtdt0(xb,xR,xd) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__850,hypothesis,
( aElement0(xx)
& ( xb = xx
| ( ( aReductOfIn0(xx,xb,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xb,xR)
& sdtmndtplgtdt0(X1,xR,xx) ) )
& sdtmndtplgtdt0(xb,xR,xx) ) )
& sdtmndtasgtdt0(xb,xR,xx)
& ( xd = xx
| ( ( aReductOfIn0(xx,xd,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xd,xR)
& sdtmndtplgtdt0(X1,xR,xx) ) )
& sdtmndtplgtdt0(xd,xR,xx) ) )
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__850) ).
fof(m__818,hypothesis,
( aElement0(xd)
& ( xw = xd
| ( ( aReductOfIn0(xd,xw,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xw,xR)
& sdtmndtplgtdt0(X1,xR,xd) ) )
& sdtmndtplgtdt0(xw,xR,xd) ) )
& sdtmndtasgtdt0(xw,xR,xd)
& ~ ? [X1] : aReductOfIn0(X1,xd,xR)
& aNormalFormOfIn0(xd,xw,xR) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__818) ).
fof(c_0_3,negated_conjecture,
~ ( xb = xd
| aReductOfIn0(xd,xb,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xb,xR)
& sdtmndtplgtdt0(X1,xR,xd) )
| sdtmndtplgtdt0(xb,xR,xd)
| sdtmndtasgtdt0(xb,xR,xd) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
( aElement0(xx)
& ( aElement0(esk14_0)
| aReductOfIn0(xx,xb,xR)
| xb = xx )
& ( aReductOfIn0(esk14_0,xb,xR)
| aReductOfIn0(xx,xb,xR)
| xb = xx )
& ( sdtmndtplgtdt0(esk14_0,xR,xx)
| aReductOfIn0(xx,xb,xR)
| xb = xx )
& ( sdtmndtplgtdt0(xb,xR,xx)
| xb = xx )
& sdtmndtasgtdt0(xb,xR,xx)
& ( aElement0(esk15_0)
| aReductOfIn0(xx,xd,xR)
| xd = xx )
& ( aReductOfIn0(esk15_0,xd,xR)
| aReductOfIn0(xx,xd,xR)
| xd = xx )
& ( sdtmndtplgtdt0(esk15_0,xR,xx)
| aReductOfIn0(xx,xd,xR)
| xd = xx )
& ( sdtmndtplgtdt0(xd,xR,xx)
| xd = xx )
& sdtmndtasgtdt0(xd,xR,xx) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__850])])])])]) ).
fof(c_0_5,hypothesis,
! [X3] :
( aElement0(xd)
& ( aElement0(esk13_0)
| aReductOfIn0(xd,xw,xR)
| xw = xd )
& ( aReductOfIn0(esk13_0,xw,xR)
| aReductOfIn0(xd,xw,xR)
| xw = xd )
& ( sdtmndtplgtdt0(esk13_0,xR,xd)
| aReductOfIn0(xd,xw,xR)
| xw = xd )
& ( sdtmndtplgtdt0(xw,xR,xd)
| xw = xd )
& sdtmndtasgtdt0(xw,xR,xd)
& ~ aReductOfIn0(X3,xd,xR)
& aNormalFormOfIn0(xd,xw,xR) ),
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__818])])])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X2] :
( xb != xd
& ~ aReductOfIn0(xd,xb,xR)
& ( ~ aElement0(X2)
| ~ aReductOfIn0(X2,xb,xR)
| ~ sdtmndtplgtdt0(X2,xR,xd) )
& ~ sdtmndtplgtdt0(xb,xR,xd)
& ~ sdtmndtasgtdt0(xb,xR,xd) ),
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_3])])])])]) ).
cnf(c_0_7,hypothesis,
( xd = xx
| aReductOfIn0(xx,xd,xR)
| aReductOfIn0(esk15_0,xd,xR) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
xd = xx,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM021+4 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 17:04:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.036 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 13
% 0.25/1.42 # Proof object clause steps : 6
% 0.25/1.42 # Proof object formula steps : 7
% 0.25/1.42 # Proof object conjectures : 5
% 0.25/1.42 # Proof object clause conjectures : 2
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 4
% 0.25/1.42 # Proof object initial formulas used : 3
% 0.25/1.42 # Proof object generating inferences : 0
% 0.25/1.42 # Proof object simplifying inferences : 5
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 25
% 0.25/1.42 # Removed by relevancy pruning/SinE : 1
% 0.25/1.42 # Initial clauses : 386
% 0.25/1.42 # Removed in clause preprocessing : 4
% 0.25/1.42 # Initial clauses in saturation : 382
% 0.25/1.42 # Processed clauses : 59
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 59
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 15
% 0.25/1.42 # Generated clauses : 16
% 0.25/1.42 # ...of the previous two non-trivial : 8
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 16
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 44
% 0.25/1.42 # Positive orientable unit clauses : 20
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 0
% 0.25/1.42 # Non-unit-clauses : 24
% 0.25/1.42 # Current number of unprocessed clauses: 328
% 0.25/1.42 # ...number of literals in the above : 2757
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 15
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 56
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 30
% 0.25/1.42 # Non-unit clause-clause subsumptions : 0
% 0.25/1.42 # Unit Clause-clause subsumption calls : 18
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 5
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 20828
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.032 s
% 0.25/1.42 # System time : 0.006 s
% 0.25/1.42 # Total time : 0.038 s
% 0.25/1.42 # Maximum resident set size: 3948 pages
%------------------------------------------------------------------------------