TSTP Solution File: SEU159+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:25:00 EDT 2023
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 97 ( 29 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 38 ~; 51 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 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-3 aty)
% Number of variables : 63 ( 4 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t38_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.lzffWm7SLI/E---3.1_3232.p',t38_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.lzffWm7SLI/E---3.1_3232.p',d3_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lzffWm7SLI/E---3.1_3232.p',d2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
inference(assume_negation,[status(cth)],[t38_zfmisc_1]) ).
fof(c_0_4,plain,
! [X19,X20,X21,X22,X23] :
( ( ~ subset(X19,X20)
| ~ in(X21,X19)
| in(X21,X20) )
& ( in(esk5_2(X22,X23),X22)
| subset(X22,X23) )
& ( ~ in(esk5_2(X22,X23),X23)
| subset(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ( ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk3_0) )
& ( in(esk1_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) )
& ( in(esk2_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( ~ in(X13,X12)
| X13 = X10
| X13 = X11
| X12 != unordered_pair(X10,X11) )
& ( X14 != X10
| in(X14,X12)
| X12 != unordered_pair(X10,X11) )
& ( X14 != X11
| in(X14,X12)
| X12 != unordered_pair(X10,X11) )
& ( esk4_3(X15,X16,X17) != X15
| ~ in(esk4_3(X15,X16,X17),X17)
| X17 = unordered_pair(X15,X16) )
& ( esk4_3(X15,X16,X17) != X16
| ~ in(esk4_3(X15,X16,X17),X17)
| X17 = unordered_pair(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X17)
| esk4_3(X15,X16,X17) = X15
| esk4_3(X15,X16,X17) = X16
| X17 = unordered_pair(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])]) ).
cnf(c_0_7,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( in(esk1_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( in(esk1_0,esk3_0)
| in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
( in(esk2_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(esk5_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
in(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( in(esk2_0,esk3_0)
| in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_20,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X2
| esk5_2(unordered_pair(X1,X2),X3) = X1
| subset(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
in(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X2
| subset(unordered_pair(X1,X2),X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ subset(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n007.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 08:01:54 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.42 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.lzffWm7SLI/E---3.1_3232.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # sh5l with pid 3313 completed with status 0
% 0.16/0.43 # Result found by sh5l
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.43 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 3319 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.43 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 7
% 0.16/0.43 # Removed by relevancy pruning/SinE : 1
% 0.16/0.43 # Initial clauses : 15
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 15
% 0.16/0.43 # Processed clauses : 70
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 18
% 0.16/0.43 # ...remaining for further processing : 52
% 0.16/0.43 # Other redundant clauses eliminated : 25
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 6
% 0.16/0.43 # Generated clauses : 125
% 0.16/0.43 # ...of the previous two non-redundant : 84
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 88
% 0.16/0.43 # Factorizations : 14
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 25
% 0.16/0.43 # Total rewrite steps : 24
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 28
% 0.16/0.43 # Positive orientable unit clauses : 5
% 0.16/0.43 # Positive unorientable unit clauses: 1
% 0.16/0.43 # Negative unit clauses : 5
% 0.16/0.43 # Non-unit-clauses : 17
% 0.16/0.43 # Current number of unprocessed clauses: 39
% 0.16/0.43 # ...number of literals in the above : 161
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 21
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 91
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 87
% 0.16/0.43 # Non-unit clause-clause subsumptions : 9
% 0.16/0.43 # Unit Clause-clause subsumption calls : 10
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 12
% 0.16/0.43 # BW rewrite match successes : 10
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 2137
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.006 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.007 s
% 0.16/0.43 # Maximum resident set size: 1760 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.006 s
% 0.16/0.43 # System time : 0.004 s
% 0.16/0.43 # Total time : 0.010 s
% 0.16/0.43 # Maximum resident set size: 1676 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------