TSTP Solution File: SET945+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:38 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 134 ( 28 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 159 ( 67 ~; 66 |; 17 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 108 ( 17 sgn 49 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_xboole_0) ).
fof(t98_zfmisc_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t98_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_r1_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotence_k3_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk7_3(X5,X6,X7),X7)
| ~ in(esk7_3(X5,X6,X7),X5)
| ~ in(esk7_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X5)
| in(esk7_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X6)
| in(esk7_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
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_xboole_0])])])])])])]) ).
cnf(c_0_8,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X4,X5,X4,X5,X7] :
( ( disjoint(X4,X5)
| in(esk3_2(X4,X5),set_intersection2(X4,X5)) )
& ( ~ in(X7,set_intersection2(X4,X5))
| ~ disjoint(X4,X5) ) ),
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)],[inference(fof_simplification,[status(thm)],[t4_xboole_0])])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
inference(assume_negation,[status(cth)],[t98_zfmisc_1]) ).
cnf(c_0_11,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( in(esk3_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_14,negated_conjecture,
! [X6] :
( ( ~ in(X6,esk1_0)
| disjoint(X6,esk2_0) )
& ~ disjoint(union(esk1_0),esk2_0) ),
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_10])])])])])]) ).
fof(c_0_15,plain,
! [X3] : set_intersection2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_16,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( disjoint(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( disjoint(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( disjoint(esk2_0,X1)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ disjoint(X1,X1)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( disjoint(X1,set_intersection2(esk2_0,X2))
| ~ in(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(X1,set_intersection2(esk2_0,X2))
| ~ in(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X5,X6,X7,X7,X9,X5,X6,X11] :
( ( in(X7,esk4_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk4_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X7,X9)
| ~ in(X9,X5)
| in(X7,X6)
| X6 != union(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(esk5_2(X5,X6),X11)
| ~ in(X11,X5)
| X6 = union(X5) )
& ( in(esk5_2(X5,X6),esk6_2(X5,X6))
| in(esk5_2(X5,X6),X6)
| X6 = union(X5) )
& ( in(esk6_2(X5,X6),X5)
| in(esk5_2(X5,X6),X6)
| X6 = union(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)],[d4_tarski])])])])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(X1,esk1_0)
| ~ in(X2,esk2_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( in(esk4_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_32,negated_conjecture,
( X1 != union(esk1_0)
| ~ in(X2,esk4_3(esk1_0,X1,X3))
| ~ in(X2,esk2_0)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( in(X3,esk4_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( X1 != union(esk1_0)
| ~ in(X2,esk2_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),set_intersection2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( disjoint(X1,esk2_0)
| X2 != union(esk1_0)
| ~ in(esk3_2(X1,esk2_0),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_38,plain,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ disjoint(union(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
( disjoint(X1,esk2_0)
| X1 != union(esk1_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n003.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 : Sun Jul 10 01:43:29 EDT 2022
% 0.12/0.34 % 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 # 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 : 42
% 0.22/1.41 # Proof object clause steps : 27
% 0.22/1.41 # Proof object formula steps : 15
% 0.22/1.41 # Proof object conjectures : 14
% 0.22/1.41 # Proof object clause conjectures : 11
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 11
% 0.22/1.41 # Proof object initial formulas used : 7
% 0.22/1.41 # Proof object generating inferences : 16
% 0.22/1.41 # Proof object simplifying inferences : 0
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 10
% 0.22/1.41 # Removed by relevancy pruning/SinE : 2
% 0.22/1.41 # Initial clauses : 20
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 20
% 0.22/1.41 # Processed clauses : 2394
% 0.22/1.41 # ...of these trivial : 4
% 0.22/1.41 # ...subsumed : 1779
% 0.22/1.41 # ...remaining for further processing : 611
% 0.22/1.41 # Other redundant clauses eliminated : 3
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 50
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 34077
% 0.22/1.41 # ...of the previous two non-trivial : 33839
% 0.22/1.41 # Contextual simplify-reflections : 815
% 0.22/1.41 # Paramodulations : 34014
% 0.22/1.41 # Factorizations : 20
% 0.22/1.41 # Equation resolutions : 43
% 0.22/1.41 # Current number of processed clauses : 561
% 0.22/1.41 # Positive orientable unit clauses : 3
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 8
% 0.22/1.41 # Non-unit-clauses : 549
% 0.22/1.41 # Current number of unprocessed clauses: 26611
% 0.22/1.41 # ...number of literals in the above : 120022
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 50
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 102021
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 76702
% 0.22/1.41 # Non-unit clause-clause subsumptions : 2327
% 0.22/1.41 # Unit Clause-clause subsumption calls : 298
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 15
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 604848
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.605 s
% 0.22/1.41 # System time : 0.014 s
% 0.22/1.41 # Total time : 0.619 s
% 0.22/1.41 # Maximum resident set size: 25476 pages
% 0.22/23.41 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.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.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.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------