TSTP Solution File: SET931+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET931+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:24 EDT 2023
% Result : Theorem 0.38s 0.55s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 10 unt; 0 def)
% Number of atoms : 114 ( 83 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 130 ( 54 ~; 54 |; 18 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 13 sgn; 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t75_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_difference(X1,unordered_pair(X2,X3)) = empty_set
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.yXnkQnbpQP/E---3.1_4041.p',t75_zfmisc_1) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.yXnkQnbpQP/E---3.1_4041.p',t37_xboole_1) ).
fof(l46_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.yXnkQnbpQP/E---3.1_4041.p',l46_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.yXnkQnbpQP/E---3.1_4041.p',reflexivity_r1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(X1,unordered_pair(X2,X3)) = empty_set
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
inference(assume_negation,[status(cth)],[t75_zfmisc_1]) ).
fof(c_0_5,plain,
! [X12,X13] :
( ( set_difference(X12,X13) != empty_set
| subset(X12,X13) )
& ( ~ subset(X12,X13)
| set_difference(X12,X13) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])]) ).
fof(c_0_6,negated_conjecture,
( ( esk1_0 != empty_set
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set )
& ( esk1_0 != singleton(esk2_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set )
& ( esk1_0 != singleton(esk3_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set )
& ( esk1_0 != unordered_pair(esk2_0,esk3_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set )
& ( set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) = empty_set
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0)
| esk1_0 = singleton(esk3_0)
| esk1_0 = unordered_pair(esk2_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X9,X10,X11] :
( ( ~ subset(X9,unordered_pair(X10,X11))
| X9 = empty_set
| X9 = singleton(X10)
| X9 = singleton(X11)
| X9 = unordered_pair(X10,X11) )
& ( X9 != empty_set
| subset(X9,unordered_pair(X10,X11)) )
& ( X9 != singleton(X10)
| subset(X9,unordered_pair(X10,X11)) )
& ( X9 != singleton(X11)
| subset(X9,unordered_pair(X10,X11)) )
& ( X9 != unordered_pair(X10,X11)
| subset(X9,unordered_pair(X10,X11)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l46_zfmisc_1])])]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) = empty_set
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0)
| esk1_0 = singleton(esk3_0)
| esk1_0 = unordered_pair(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,unordered_pair(X3,X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X2,X3)
| ~ subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| singleton(esk3_0) = esk1_0
| singleton(esk2_0) = esk1_0
| empty_set = esk1_0
| subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( esk1_0 != singleton(esk3_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
subset(singleton(X1),unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| singleton(esk2_0) = esk1_0
| singleton(esk3_0) = esk1_0
| empty_set = esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( singleton(esk3_0) != esk1_0
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| singleton(esk2_0) = esk1_0
| empty_set = esk1_0
| subset(esk1_0,unordered_pair(X1,esk3_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 != singleton(esk2_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,plain,
subset(singleton(X1),unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| singleton(esk2_0) = esk1_0
| empty_set = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( esk1_0 != unordered_pair(esk2_0,esk3_0)
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( singleton(esk2_0) != esk1_0
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| empty_set = esk1_0
| subset(esk1_0,unordered_pair(esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X14] : subset(X14,X14),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_27,negated_conjecture,
( esk1_0 != empty_set
| set_difference(esk1_0,unordered_pair(esk2_0,esk3_0)) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) != esk1_0
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| empty_set = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_30,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
( empty_set != esk1_0
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_33,negated_conjecture,
empty_set = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
subset(empty_set,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,plain,
subset(esk1_0,unordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET931+1 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 17:28:14 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.24/0.53 Running first-order model finding
% 0.24/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.yXnkQnbpQP/E---3.1_4041.p
% 0.38/0.55 # Version: 3.1pre001
% 0.38/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # sh5l with pid 4121 completed with status 0
% 0.38/0.55 # Result found by sh5l
% 0.38/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.55 # Search class: FGHSS-FFSS21-SFFFFFNN
% 0.38/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/0.55 # SAT001_MinMin_p005000_rr_RG with pid 4125 completed with status 0
% 0.38/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.38/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.55 # Search class: FGHSS-FFSS21-SFFFFFNN
% 0.38/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/0.55 # Preprocessing time : 0.001 s
% 0.38/0.55 # Presaturation interreduction done
% 0.38/0.55
% 0.38/0.55 # Proof found!
% 0.38/0.55 # SZS status Theorem
% 0.38/0.55 # SZS output start CNFRefutation
% See solution above
% 0.38/0.55 # Parsed axioms : 8
% 0.38/0.55 # Removed by relevancy pruning/SinE : 0
% 0.38/0.55 # Initial clauses : 17
% 0.38/0.55 # Removed in clause preprocessing : 0
% 0.38/0.55 # Initial clauses in saturation : 17
% 0.38/0.55 # Processed clauses : 62
% 0.38/0.55 # ...of these trivial : 2
% 0.38/0.55 # ...subsumed : 6
% 0.38/0.55 # ...remaining for further processing : 54
% 0.38/0.55 # Other redundant clauses eliminated : 4
% 0.38/0.55 # Clauses deleted for lack of memory : 0
% 0.38/0.55 # Backward-subsumed : 10
% 0.38/0.55 # Backward-rewritten : 12
% 0.38/0.55 # Generated clauses : 65
% 0.38/0.55 # ...of the previous two non-redundant : 52
% 0.38/0.55 # ...aggressively subsumed : 0
% 0.38/0.55 # Contextual simplify-reflections : 2
% 0.38/0.55 # Paramodulations : 61
% 0.38/0.55 # Factorizations : 0
% 0.38/0.55 # NegExts : 0
% 0.38/0.55 # Equation resolutions : 4
% 0.38/0.55 # Total rewrite steps : 24
% 0.38/0.55 # Propositional unsat checks : 0
% 0.38/0.55 # Propositional check models : 0
% 0.38/0.55 # Propositional check unsatisfiable : 0
% 0.38/0.55 # Propositional clauses : 0
% 0.38/0.55 # Propositional clauses after purity: 0
% 0.38/0.55 # Propositional unsat core size : 0
% 0.38/0.55 # Propositional preprocessing time : 0.000
% 0.38/0.55 # Propositional encoding time : 0.000
% 0.38/0.55 # Propositional solver time : 0.000
% 0.38/0.55 # Success case prop preproc time : 0.000
% 0.38/0.55 # Success case prop encoding time : 0.000
% 0.38/0.55 # Success case prop solver time : 0.000
% 0.38/0.55 # Current number of processed clauses : 12
% 0.38/0.55 # Positive orientable unit clauses : 7
% 0.38/0.55 # Positive unorientable unit clauses: 1
% 0.38/0.55 # Negative unit clauses : 2
% 0.38/0.55 # Non-unit-clauses : 2
% 0.38/0.55 # Current number of unprocessed clauses: 5
% 0.38/0.55 # ...number of literals in the above : 23
% 0.38/0.55 # Current number of archived formulas : 0
% 0.38/0.55 # Current number of archived clauses : 38
% 0.38/0.55 # Clause-clause subsumption calls (NU) : 63
% 0.38/0.55 # Rec. Clause-clause subsumption calls : 27
% 0.38/0.55 # Non-unit clause-clause subsumptions : 11
% 0.38/0.55 # Unit Clause-clause subsumption calls : 12
% 0.38/0.55 # Rewrite failures with RHS unbound : 0
% 0.38/0.55 # BW rewrite match attempts : 12
% 0.38/0.55 # BW rewrite match successes : 10
% 0.38/0.55 # Condensation attempts : 0
% 0.38/0.55 # Condensation successes : 0
% 0.38/0.55 # Termbank termtop insertions : 1396
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.005 s
% 0.38/0.55 # System time : 0.002 s
% 0.38/0.55 # Total time : 0.007 s
% 0.38/0.55 # Maximum resident set size: 1764 pages
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.005 s
% 0.38/0.55 # System time : 0.006 s
% 0.38/0.55 # Total time : 0.010 s
% 0.38/0.55 # Maximum resident set size: 1676 pages
% 0.38/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------