%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:52 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 32 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 8 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_finsub_1,conjecture,
! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t25_finsub_1) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_xboole_1) ).
fof(t23_finsub_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_finsub_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
inference(assume_negation,[status(cth)],[t25_finsub_1]) ).
fof(c_0_6,negated_conjecture,
~ subset(set_union2(finite_subsets(esk1_0),finite_subsets(esk2_0)),finite_subsets(set_union2(esk1_0,esk2_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
cnf(c_0_8,negated_conjecture,
~ subset(set_union2(finite_subsets(esk1_0),finite_subsets(esk2_0)),finite_subsets(set_union2(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| subset(finite_subsets(X3),finite_subsets(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_finsub_1])]) ).
cnf(c_0_11,negated_conjecture,
( ~ subset(finite_subsets(esk2_0),finite_subsets(set_union2(esk1_0,esk2_0)))
| ~ subset(finite_subsets(esk1_0),finite_subsets(set_union2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_14,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_15,negated_conjecture,
( ~ subset(finite_subsets(esk1_0),finite_subsets(set_union2(esk1_0,esk2_0)))
| ~ subset(esk2_0,set_union2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ subset(esk2_0,set_union2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_16])]) ).
cnf(c_0_19,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 11:37:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.016 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 21
% 0.21/1.41 # Proof object clause steps : 10
% 0.21/1.41 # Proof object formula steps : 11
% 0.21/1.41 # Proof object conjectures : 8
% 0.21/1.41 # Proof object clause conjectures : 5
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 5
% 0.21/1.41 # Proof object initial formulas used : 5
% 0.21/1.41 # Proof object generating inferences : 4
% 0.21/1.41 # Proof object simplifying inferences : 4
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 40
% 0.21/1.41 # Removed by relevancy pruning/SinE : 11
% 0.21/1.41 # Initial clauses : 44
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 44
% 0.21/1.41 # Processed clauses : 55
% 0.21/1.41 # ...of these trivial : 1
% 0.21/1.41 # ...subsumed : 1
% 0.21/1.41 # ...remaining for further processing : 53
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 0
% 0.21/1.41 # Backward-rewritten : 5
% 0.21/1.41 # Generated clauses : 50
% 0.21/1.41 # ...of the previous two non-trivial : 37
% 0.21/1.41 # Contextual simplify-reflections : 0
% 0.21/1.41 # Paramodulations : 50
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 48
% 0.21/1.41 # Positive orientable unit clauses : 18
% 0.21/1.41 # Positive unorientable unit clauses: 1
% 0.21/1.41 # Negative unit clauses : 5
% 0.21/1.41 # Non-unit-clauses : 24
% 0.21/1.41 # Current number of unprocessed clauses: 18
% 0.21/1.41 # ...number of literals in the above : 42
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 5
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 43
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 40
% 0.21/1.41 # Non-unit clause-clause subsumptions : 0
% 0.21/1.41 # Unit Clause-clause subsumption calls : 33
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 14
% 0.21/1.41 # BW rewrite match successes : 11
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 2427
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.017 s
% 0.21/1.41 # System time : 0.001 s
% 0.21/1.41 # Total time : 0.018 s
% 0.21/1.41 # Maximum resident set size: 3016 pages
% 0.21/22.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.39 eprover: No such file or directory
% 0.21/22.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.39 eprover: No such file or directory
% 0.21/22.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.40 eprover: No such file or directory
% 0.21/22.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.40 eprover: No such file or directory
% 0.21/22.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.41 eprover: No such file or directory
% 0.21/22.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.41 eprover: No such file or directory
% 0.21/22.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.42 eprover: No such file or directory
% 0.21/22.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.43 eprover: No such file or directory
% 0.21/22.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.43 eprover: No such file or directory
% 0.21/22.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.44 eprover: No such file or directory
% 0.21/22.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/22.44 eprover: No such file or directory
%------------------------------------------------------------------------------