TSTP Solution File: SET997+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET997+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 00:55:57 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 93 ( 21 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 120 ( 46 ~; 46 |; 19 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 43 ( 4 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
~ ( in(X4,relation_dom(X2))
& X3 = apply(X2,X4) ) )
=> subset(X1,relation_rng(X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t19_funct_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_funct_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
~ ( in(X4,relation_dom(X2))
& X3 = apply(X2,X4) ) )
=> subset(X1,relation_rng(X2)) ) ),
inference(assume_negation,[status(cth)],[t19_funct_1]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( in(esk5_3(X5,X6,X7),relation_dom(X5))
| ~ in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( X7 = apply(X5,esk5_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( ~ in(X9,relation_dom(X5))
| X7 != apply(X5,X9)
| in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( ~ in(esk6_2(X5,X6),X6)
| ~ in(X11,relation_dom(X5))
| esk6_2(X5,X6) != apply(X5,X11)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk7_2(X5,X6),relation_dom(X5))
| in(esk6_2(X5,X6),X6)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( esk6_2(X5,X6) = apply(X5,esk7_2(X5,X6))
| in(esk6_2(X5,X6),X6)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) ) ),
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)],[d5_funct_1])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( relation(esk2_0)
& function(esk2_0)
& ( in(esk3_1(X7),relation_dom(esk2_0))
| ~ in(X7,esk1_0) )
& ( X7 = apply(esk2_0,esk3_1(X7))
| ~ in(X7,esk1_0) )
& ~ subset(esk1_0,relation_rng(esk2_0)) ),
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])])])])])])]) ).
cnf(c_0_6,plain,
( in(X3,X2)
| ~ function(X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| X3 != apply(X1,X4)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( X1 = apply(esk2_0,esk3_1(X1))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( in(esk3_1(X1),relation_dom(esk2_0))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,X2)
| X2 != relation_rng(esk2_0)
| ~ in(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])])]),c_0_10]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( subset(esk1_0,X1)
| in(esk4_2(esk1_0,X1),X2)
| X2 != relation_rng(esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( subset(esk1_0,X1)
| X1 != relation_rng(esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET997+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n010.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 : Sat Jul 9 19:02:01 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 19
% 0.24/1.42 # Proof object clause steps : 12
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 12
% 0.24/1.42 # Proof object clause conjectures : 9
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 4
% 0.24/1.42 # Proof object simplifying inferences : 5
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 32
% 0.24/1.42 # Removed by relevancy pruning/SinE : 5
% 0.24/1.42 # Initial clauses : 46
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 46
% 0.24/1.42 # Processed clauses : 207
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 77
% 0.24/1.42 # ...remaining for further processing : 129
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 11
% 0.24/1.42 # Backward-rewritten : 6
% 0.24/1.42 # Generated clauses : 336
% 0.24/1.42 # ...of the previous two non-trivial : 303
% 0.24/1.42 # Contextual simplify-reflections : 33
% 0.24/1.42 # Paramodulations : 331
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 5
% 0.24/1.42 # Current number of processed clauses : 112
% 0.24/1.42 # Positive orientable unit clauses : 16
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 13
% 0.24/1.42 # Non-unit-clauses : 83
% 0.24/1.42 # Current number of unprocessed clauses: 110
% 0.24/1.42 # ...number of literals in the above : 423
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 17
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1720
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 692
% 0.24/1.42 # Non-unit clause-clause subsumptions : 87
% 0.24/1.42 # Unit Clause-clause subsumption calls : 212
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 10
% 0.24/1.42 # BW rewrite match successes : 3
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 5857
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.028 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.030 s
% 0.24/1.42 # Maximum resident set size: 3288 pages
%------------------------------------------------------------------------------