TSTP Solution File: SEU152+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU152+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:24:58 EDT 2023
% Result : Theorem 0.38s 0.54s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 37 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 10 ~; 6 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l23_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',l23_zfmisc_1) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',l2_zfmisc_1) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',l32_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',commutativity_k2_xboole_0) ).
fof(t39_xboole_1,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',t39_xboole_1) ).
fof(t1_boole,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p',t1_boole) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[l23_zfmisc_1]) ).
fof(c_0_7,lemma,
! [X41,X42] :
( ( ~ subset(singleton(X41),X42)
| in(X41,X42) )
& ( ~ in(X41,X42)
| subset(singleton(X41),X42) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).
fof(c_0_8,negated_conjecture,
( in(esk1_0,esk2_0)
& set_union2(singleton(esk1_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,lemma,
! [X89,X90] :
( ( set_difference(X89,X90) != empty_set
| subset(X89,X90) )
& ( ~ subset(X89,X90)
| set_difference(X89,X90) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])]) ).
cnf(c_0_10,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_13,lemma,
! [X22,X23] : set_union2(X22,set_difference(X23,X22)) = set_union2(X22,X23),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
cnf(c_0_14,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
subset(singleton(esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_16,plain,
! [X21] : set_union2(X21,empty_set) = X21,
inference(variable_rename,[status(thm)],[t1_boole]) ).
cnf(c_0_17,negated_conjecture,
set_union2(singleton(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
set_difference(singleton(esk1_0),esk2_0) = empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
set_union2(esk2_0,singleton(esk1_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,lemma,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SEU152+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 09:02:21 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.4LJYZPFwRX/E---3.1_30417.p
% 0.38/0.54 # Version: 3.1pre001
% 0.38/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.54 # Starting sh5l with 300s (1) cores
% 0.38/0.54 # new_bool_1 with pid 30497 completed with status 0
% 0.38/0.54 # Result found by new_bool_1
% 0.38/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.54 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.38/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.54 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.38/0.54 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 30499 completed with status 0
% 0.38/0.54 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.38/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.54 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.38/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.54 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.38/0.54 # Preprocessing time : 0.001 s
% 0.38/0.54
% 0.38/0.54 # Proof found!
% 0.38/0.54 # SZS status Theorem
% 0.38/0.54 # SZS output start CNFRefutation
% See solution above
% 0.38/0.54 # Parsed axioms : 75
% 0.38/0.54 # Removed by relevancy pruning/SinE : 33
% 0.38/0.54 # Initial clauses : 72
% 0.38/0.54 # Removed in clause preprocessing : 0
% 0.38/0.54 # Initial clauses in saturation : 72
% 0.38/0.54 # Processed clauses : 123
% 0.38/0.54 # ...of these trivial : 23
% 0.38/0.54 # ...subsumed : 24
% 0.38/0.54 # ...remaining for further processing : 76
% 0.38/0.54 # Other redundant clauses eliminated : 9
% 0.38/0.54 # Clauses deleted for lack of memory : 0
% 0.38/0.54 # Backward-subsumed : 0
% 0.38/0.54 # Backward-rewritten : 1
% 0.38/0.54 # Generated clauses : 443
% 0.38/0.54 # ...of the previous two non-redundant : 176
% 0.38/0.54 # ...aggressively subsumed : 0
% 0.38/0.54 # Contextual simplify-reflections : 0
% 0.38/0.54 # Paramodulations : 435
% 0.38/0.54 # Factorizations : 0
% 0.38/0.54 # NegExts : 0
% 0.38/0.54 # Equation resolutions : 9
% 0.38/0.54 # Total rewrite steps : 541
% 0.38/0.54 # Propositional unsat checks : 0
% 0.38/0.54 # Propositional check models : 0
% 0.38/0.54 # Propositional check unsatisfiable : 0
% 0.38/0.54 # Propositional clauses : 0
% 0.38/0.54 # Propositional clauses after purity: 0
% 0.38/0.54 # Propositional unsat core size : 0
% 0.38/0.54 # Propositional preprocessing time : 0.000
% 0.38/0.54 # Propositional encoding time : 0.000
% 0.38/0.54 # Propositional solver time : 0.000
% 0.38/0.54 # Success case prop preproc time : 0.000
% 0.38/0.54 # Success case prop encoding time : 0.000
% 0.38/0.54 # Success case prop solver time : 0.000
% 0.38/0.54 # Current number of processed clauses : 67
% 0.38/0.54 # Positive orientable unit clauses : 41
% 0.38/0.54 # Positive unorientable unit clauses: 2
% 0.38/0.54 # Negative unit clauses : 10
% 0.38/0.54 # Non-unit-clauses : 14
% 0.38/0.54 # Current number of unprocessed clauses: 122
% 0.38/0.54 # ...number of literals in the above : 217
% 0.38/0.54 # Current number of archived formulas : 0
% 0.38/0.54 # Current number of archived clauses : 1
% 0.38/0.54 # Clause-clause subsumption calls (NU) : 22
% 0.38/0.54 # Rec. Clause-clause subsumption calls : 14
% 0.38/0.54 # Non-unit clause-clause subsumptions : 2
% 0.38/0.54 # Unit Clause-clause subsumption calls : 18
% 0.38/0.54 # Rewrite failures with RHS unbound : 0
% 0.38/0.54 # BW rewrite match attempts : 30
% 0.38/0.54 # BW rewrite match successes : 12
% 0.38/0.54 # Condensation attempts : 0
% 0.38/0.54 # Condensation successes : 0
% 0.38/0.54 # Termbank termtop insertions : 6246
% 0.38/0.54
% 0.38/0.54 # -------------------------------------------------
% 0.38/0.54 # User time : 0.009 s
% 0.38/0.54 # System time : 0.002 s
% 0.38/0.54 # Total time : 0.011 s
% 0.38/0.54 # Maximum resident set size: 1876 pages
% 0.38/0.54
% 0.38/0.54 # -------------------------------------------------
% 0.38/0.54 # User time : 0.011 s
% 0.38/0.54 # System time : 0.004 s
% 0.38/0.54 # Total time : 0.015 s
% 0.38/0.54 # Maximum resident set size: 1744 pages
% 0.38/0.54 % E---3.1 exiting
% 0.38/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------