TSTP Solution File: SEU103+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:49 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 98 ( 9 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 114 ( 45 ~; 41 |; 20 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_finsub_1,conjecture,
! [X1,X2,X3] :
( ( ~ empty(X3)
& preboolean(X3) )
=> ( ( element(X1,X3)
& element(X2,X3) )
=> element(symmetric_difference(X1,X2),X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t14_finsub_1) ).
fof(d6_xboole_0,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d6_xboole_0) ).
fof(dt_k1_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_union2(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_finsub_1) ).
fof(redefinition_k1_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_union2(X1,X2,X3) = set_union2(X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k1_finsub_1) ).
fof(dt_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_finsub_1) ).
fof(redefinition_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k2_finsub_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ empty(X3)
& preboolean(X3) )
=> ( ( element(X1,X3)
& element(X2,X3) )
=> element(symmetric_difference(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[t14_finsub_1]) ).
fof(c_0_7,negated_conjecture,
( ~ empty(esk13_0)
& preboolean(esk13_0)
& element(esk11_0,esk13_0)
& element(esk12_0,esk13_0)
& ~ element(symmetric_difference(esk11_0,esk12_0),esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X3,X4] : symmetric_difference(X3,X4) = set_union2(set_difference(X3,X4),set_difference(X4,X3)),
inference(variable_rename,[status(thm)],[d6_xboole_0]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| element(prebool_union2(X4,X5,X6),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k1_finsub_1])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| prebool_union2(X4,X5,X6) = set_union2(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_k1_finsub_1])])]) ).
cnf(c_0_11,negated_conjecture,
~ element(symmetric_difference(esk11_0,esk12_0),esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( element(prebool_union2(X1,X2,X3),X1)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( prebool_union2(X1,X2,X3) = set_union2(X2,X3)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| element(prebool_difference(X4,X5,X6),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k2_finsub_1])])]) ).
fof(c_0_16,plain,
! [X4,X5,X6] :
( empty(X4)
| ~ preboolean(X4)
| ~ element(X5,X4)
| ~ element(X6,X4)
| prebool_difference(X4,X5,X6) = set_difference(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_k2_finsub_1])])]) ).
cnf(c_0_17,negated_conjecture,
~ element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( element(set_union2(X1,X2),X3)
| empty(X3)
| ~ element(X2,X3)
| ~ element(X1,X3)
| ~ preboolean(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
preboolean(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
~ empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
( element(prebool_difference(X1,X2,X3),X1)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ element(set_difference(esk12_0,esk11_0),esk13_0)
| ~ element(set_difference(esk11_0,esk12_0),esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,plain,
( element(set_difference(X1,X2),X3)
| empty(X3)
| ~ element(X2,X3)
| ~ element(X1,X3)
| ~ preboolean(X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
element(esk11_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
element(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
~ element(set_difference(esk11_0,esk12_0),esk13_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_19])]),c_0_20]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_26]),c_0_25]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 08:32:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 46
% 0.22/1.41 # Removed by relevancy pruning/SinE : 18
% 0.22/1.41 # Initial clauses : 39
% 0.22/1.41 # Removed in clause preprocessing : 1
% 0.22/1.41 # Initial clauses in saturation : 38
% 0.22/1.41 # Processed clauses : 68
% 0.22/1.41 # ...of these trivial : 7
% 0.22/1.41 # ...subsumed : 12
% 0.22/1.41 # ...remaining for further processing : 49
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 9
% 0.22/1.41 # Generated clauses : 62
% 0.22/1.41 # ...of the previous two non-trivial : 45
% 0.22/1.41 # Contextual simplify-reflections : 2
% 0.22/1.41 # Paramodulations : 62
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 40
% 0.22/1.41 # Positive orientable unit clauses : 15
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 5
% 0.22/1.41 # Non-unit-clauses : 19
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 10
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 106
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 105
% 0.22/1.41 # Non-unit clause-clause subsumptions : 14
% 0.22/1.41 # Unit Clause-clause subsumption calls : 41
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 14
% 0.22/1.41 # BW rewrite match successes : 13
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 2410
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.015 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.019 s
% 0.22/1.41 # Maximum resident set size: 3020 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.017 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 29
% 0.22/1.41 # Proof object clause steps : 16
% 0.22/1.41 # Proof object formula steps : 13
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 10
% 0.22/1.41 # Proof object initial formulas used : 6
% 0.22/1.41 # Proof object generating inferences : 5
% 0.22/1.41 # Proof object simplifying inferences : 14
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 46
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 72
% 0.22/1.41 # Removed in clause preprocessing : 1
% 0.22/1.41 # Initial clauses in saturation : 71
% 0.22/1.41 # Processed clauses : 158
% 0.22/1.41 # ...of these trivial : 4
% 0.22/1.41 # ...subsumed : 35
% 0.22/1.41 # ...remaining for further processing : 119
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 16
% 0.22/1.41 # Generated clauses : 193
% 0.22/1.41 # ...of the previous two non-trivial : 153
% 0.22/1.41 # Contextual simplify-reflections : 14
% 0.22/1.41 # Paramodulations : 193
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 102
% 0.22/1.41 # Positive orientable unit clauses : 29
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 7
% 0.22/1.41 # Non-unit-clauses : 65
% 0.22/1.41 # Current number of unprocessed clauses: 56
% 0.22/1.41 # ...number of literals in the above : 256
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 18
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 1775
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 653
% 0.22/1.41 # Non-unit clause-clause subsumptions : 50
% 0.22/1.41 # Unit Clause-clause subsumption calls : 21
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 22
% 0.22/1.41 # BW rewrite match successes : 14
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6114
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.021 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.025 s
% 0.22/1.41 # Maximum resident set size: 3268 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
%------------------------------------------------------------------------------