TSTP Solution File: SEU152+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:57 EDT 2023
% Result : Theorem 0.18s 0.44s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 31 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 7 |; 2 &)
% ( 1 <=>; 3 =>; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l23_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.Fwkj3jmg9h/E---3.1_16003.p',l23_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.Fwkj3jmg9h/E---3.1_16003.p',t12_xboole_1) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Fwkj3jmg9h/E---3.1_16003.p',l2_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Fwkj3jmg9h/E---3.1_16003.p',commutativity_k2_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[l23_zfmisc_1]) ).
fof(c_0_5,plain,
! [X8,X9] :
( ~ subset(X8,X9)
| set_union2(X8,X9) = X9 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
fof(c_0_6,plain,
! [X10,X11] :
( ( ~ subset(singleton(X10),X11)
| in(X10,X11) )
& ( ~ in(X10,X11)
| subset(singleton(X10),X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).
fof(c_0_7,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_4])])]) ).
fof(c_0_8,plain,
! [X5,X6] : set_union2(X5,X6) = set_union2(X6,X5),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_9,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
set_union2(singleton(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
set_union2(esk2_0,singleton(esk1_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( set_union2(X1,singleton(X2)) = X1
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:04:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Fwkj3jmg9h/E---3.1_16003.p
% 0.18/0.44 # Version: 3.1pre001
% 0.18/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.44 # Starting sh5l with 300s (1) cores
% 0.18/0.44 # new_bool_1 with pid 16083 completed with status 0
% 0.18/0.44 # Result found by new_bool_1
% 0.18/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.44 # Search class: FHHSS-FFSF21-SFFFFFNN
% 0.18/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.44 # SAT001_MinMin_p005000_rr_RG with pid 16088 completed with status 0
% 0.18/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.44 # Search class: FHHSS-FFSF21-SFFFFFNN
% 0.18/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.44 # Preprocessing time : 0.001 s
% 0.18/0.44 # Presaturation interreduction done
% 0.18/0.44
% 0.18/0.44 # Proof found!
% 0.18/0.44 # SZS status Theorem
% 0.18/0.44 # SZS output start CNFRefutation
% See solution above
% 0.18/0.44 # Parsed axioms : 9
% 0.18/0.44 # Removed by relevancy pruning/SinE : 2
% 0.18/0.44 # Initial clauses : 9
% 0.18/0.44 # Removed in clause preprocessing : 0
% 0.18/0.44 # Initial clauses in saturation : 9
% 0.18/0.44 # Processed clauses : 24
% 0.18/0.44 # ...of these trivial : 0
% 0.18/0.44 # ...subsumed : 0
% 0.18/0.44 # ...remaining for further processing : 24
% 0.18/0.44 # Other redundant clauses eliminated : 0
% 0.18/0.44 # Clauses deleted for lack of memory : 0
% 0.18/0.44 # Backward-subsumed : 0
% 0.18/0.44 # Backward-rewritten : 1
% 0.18/0.44 # Generated clauses : 14
% 0.18/0.44 # ...of the previous two non-redundant : 7
% 0.18/0.44 # ...aggressively subsumed : 0
% 0.18/0.44 # Contextual simplify-reflections : 0
% 0.18/0.44 # Paramodulations : 14
% 0.18/0.44 # Factorizations : 0
% 0.18/0.44 # NegExts : 0
% 0.18/0.44 # Equation resolutions : 0
% 0.18/0.44 # Total rewrite steps : 5
% 0.18/0.44 # Propositional unsat checks : 0
% 0.18/0.44 # Propositional check models : 0
% 0.18/0.44 # Propositional check unsatisfiable : 0
% 0.18/0.44 # Propositional clauses : 0
% 0.18/0.44 # Propositional clauses after purity: 0
% 0.18/0.44 # Propositional unsat core size : 0
% 0.18/0.44 # Propositional preprocessing time : 0.000
% 0.18/0.44 # Propositional encoding time : 0.000
% 0.18/0.44 # Propositional solver time : 0.000
% 0.18/0.44 # Success case prop preproc time : 0.000
% 0.18/0.44 # Success case prop encoding time : 0.000
% 0.18/0.44 # Success case prop solver time : 0.000
% 0.18/0.44 # Current number of processed clauses : 14
% 0.18/0.44 # Positive orientable unit clauses : 4
% 0.18/0.44 # Positive unorientable unit clauses: 1
% 0.18/0.44 # Negative unit clauses : 3
% 0.18/0.44 # Non-unit-clauses : 6
% 0.18/0.44 # Current number of unprocessed clauses: 1
% 0.18/0.44 # ...number of literals in the above : 2
% 0.18/0.44 # Current number of archived formulas : 0
% 0.18/0.44 # Current number of archived clauses : 10
% 0.18/0.44 # Clause-clause subsumption calls (NU) : 2
% 0.18/0.44 # Rec. Clause-clause subsumption calls : 2
% 0.18/0.44 # Non-unit clause-clause subsumptions : 0
% 0.18/0.44 # Unit Clause-clause subsumption calls : 0
% 0.18/0.44 # Rewrite failures with RHS unbound : 0
% 0.18/0.44 # BW rewrite match attempts : 10
% 0.18/0.44 # BW rewrite match successes : 8
% 0.18/0.44 # Condensation attempts : 0
% 0.18/0.44 # Condensation successes : 0
% 0.18/0.44 # Termbank termtop insertions : 472
% 0.18/0.44
% 0.18/0.44 # -------------------------------------------------
% 0.18/0.44 # User time : 0.004 s
% 0.18/0.44 # System time : 0.000 s
% 0.18/0.44 # Total time : 0.004 s
% 0.18/0.44 # Maximum resident set size: 1748 pages
% 0.18/0.44
% 0.18/0.44 # -------------------------------------------------
% 0.18/0.44 # User time : 0.006 s
% 0.18/0.44 # System time : 0.001 s
% 0.18/0.44 # Total time : 0.007 s
% 0.18/0.44 # Maximum resident set size: 1676 pages
% 0.18/0.44 % E---3.1 exiting
% 0.18/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------