TSTP Solution File: SET014+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET014+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:47:40 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 52 ( 17 ~; 22 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 5 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_union_subset,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(union(X1,X3),X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_union_subset) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(union(X1,X3),X2) ),
inference(assume_negation,[status(cth)],[prove_union_subset]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(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)],[subset_defn])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& ~ subset(union(esk1_0,esk3_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])])]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( subset(X1,esk2_0)
| ~ member(esk4_2(X1,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( subset(union(X1,X2),X3)
| member(esk4_2(union(X1,X2),X3),X1)
| member(esk4_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( subset(X1,esk2_0)
| ~ member(esk4_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( subset(union(X1,esk3_0),esk2_0)
| member(esk4_2(union(X1,esk3_0),esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ subset(union(esk1_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET014+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.15 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jul 10 12:37:03 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.46 # Preprocessing time : 0.015 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 21
% 0.27/1.46 # Proof object clause steps : 14
% 0.27/1.46 # Proof object formula steps : 7
% 0.27/1.46 # Proof object conjectures : 12
% 0.27/1.46 # Proof object clause conjectures : 9
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 7
% 0.27/1.46 # Proof object initial formulas used : 3
% 0.27/1.46 # Proof object generating inferences : 7
% 0.27/1.46 # Proof object simplifying inferences : 1
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 6
% 0.27/1.46 # Removed by relevancy pruning/SinE : 0
% 0.27/1.46 # Initial clauses : 15
% 0.27/1.46 # Removed in clause preprocessing : 2
% 0.27/1.46 # Initial clauses in saturation : 13
% 0.27/1.46 # Processed clauses : 707
% 0.27/1.46 # ...of these trivial : 56
% 0.27/1.46 # ...subsumed : 517
% 0.27/1.46 # ...remaining for further processing : 134
% 0.27/1.46 # Other redundant clauses eliminated : 0
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 2
% 0.27/1.46 # Backward-rewritten : 5
% 0.27/1.46 # Generated clauses : 1262
% 0.27/1.46 # ...of the previous two non-trivial : 1030
% 0.27/1.46 # Contextual simplify-reflections : 39
% 0.27/1.46 # Paramodulations : 1248
% 0.27/1.46 # Factorizations : 14
% 0.27/1.46 # Equation resolutions : 0
% 0.27/1.46 # Current number of processed clauses : 127
% 0.27/1.46 # Positive orientable unit clauses : 34
% 0.27/1.46 # Positive unorientable unit clauses: 1
% 0.27/1.46 # Negative unit clauses : 1
% 0.27/1.46 # Non-unit-clauses : 91
% 0.27/1.46 # Current number of unprocessed clauses: 313
% 0.27/1.46 # ...number of literals in the above : 750
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 7
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 5645
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 5606
% 0.27/1.46 # Non-unit clause-clause subsumptions : 558
% 0.27/1.46 # Unit Clause-clause subsumption calls : 57
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 73
% 0.27/1.46 # BW rewrite match successes : 5
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 14934
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.043 s
% 0.27/1.46 # System time : 0.003 s
% 0.27/1.46 # Total time : 0.046 s
% 0.27/1.46 # Maximum resident set size: 3292 pages
% 0.27/23.45 eprover: CPU time limit exceeded, terminating
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.53 eprover: No such file or directory
%------------------------------------------------------------------------------