TSTP Solution File: SEU047+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU047+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : Tue Jul 19 09:16:35 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 44 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 12 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t97_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t97_funct_1) ).
fof(t129_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t129_relat_1) ).
fof(t130_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t130_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ) ),
inference(assume_negation,[status(cth)],[t97_funct_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ subset(X4,X5)
| relation_rng_restriction(X5,relation_rng_restriction(X4,X6)) = relation_rng_restriction(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t129_relat_1])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& subset(esk1_0,esk2_0)
& ( relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0)
| relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X2,X3)
| ~ subset(X2,X1)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ subset(X4,X5)
| relation_rng_restriction(X4,relation_rng_restriction(X5,X6)) = relation_rng_restriction(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t130_relat_1])]) ).
cnf(c_0_9,negated_conjecture,
( relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,X1)) = relation_rng_restriction(esk1_0,X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
| ~ subset(X1,X2)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0)
| relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,esk3_0)) = relation_rng_restriction(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,X1)) = relation_rng_restriction(esk1_0,X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU047+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.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 : Mon Jun 20 06:39:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 17
% 0.24/1.41 # Proof object clause steps : 10
% 0.24/1.41 # Proof object formula steps : 7
% 0.24/1.41 # Proof object conjectures : 11
% 0.24/1.41 # Proof object clause conjectures : 8
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 5
% 0.24/1.41 # Proof object initial formulas used : 3
% 0.24/1.41 # Proof object generating inferences : 4
% 0.24/1.41 # Proof object simplifying inferences : 3
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 33
% 0.24/1.41 # Removed by relevancy pruning/SinE : 7
% 0.24/1.41 # Initial clauses : 38
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 38
% 0.24/1.41 # Processed clauses : 53
% 0.24/1.41 # ...of these trivial : 1
% 0.24/1.41 # ...subsumed : 2
% 0.24/1.41 # ...remaining for further processing : 50
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 8
% 0.24/1.41 # Generated clauses : 50
% 0.24/1.41 # ...of the previous two non-trivial : 45
% 0.24/1.41 # Contextual simplify-reflections : 1
% 0.24/1.41 # Paramodulations : 50
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 42
% 0.24/1.41 # Positive orientable unit clauses : 19
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 4
% 0.24/1.41 # Non-unit-clauses : 19
% 0.24/1.41 # Current number of unprocessed clauses: 24
% 0.24/1.41 # ...number of literals in the above : 47
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 8
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 40
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 38
% 0.24/1.41 # Non-unit clause-clause subsumptions : 3
% 0.24/1.41 # Unit Clause-clause subsumption calls : 54
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 8
% 0.24/1.41 # BW rewrite match successes : 3
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 2271
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.016 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.019 s
% 0.24/1.41 # Maximum resident set size: 2988 pages
%------------------------------------------------------------------------------