TSTP Solution File: SET884+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET884+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:18 EDT 2023
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 79 ( 42 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 97 ( 38 ~; 37 |; 16 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( subset(singleton(X1),unordered_pair(X2,X3))
& X1 != X2
& X1 != X3 ),
file('/export/starexec/sandbox/tmp/tmp.4xoW4EjLV4/E---3.1_10960.p',t25_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.4xoW4EjLV4/E---3.1_10960.p',d3_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.4xoW4EjLV4/E---3.1_10960.p',d1_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.4xoW4EjLV4/E---3.1_10960.p',d2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( subset(singleton(X1),unordered_pair(X2,X3))
& X1 != X2
& X1 != X3 ),
inference(assume_negation,[status(cth)],[t25_zfmisc_1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ in(X10,X8)
| in(X10,X9) )
& ( in(esk4_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ in(esk4_2(X11,X12),X12)
| subset(X11,X12) ) ),
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_6,negated_conjecture,
( subset(singleton(esk1_0),unordered_pair(esk2_0,esk3_0))
& esk1_0 != esk2_0
& esk1_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X26,X27,X28,X29,X30,X31] :
( ( ~ in(X28,X27)
| X28 = X26
| X27 != singleton(X26) )
& ( X29 != X26
| in(X29,X27)
| X27 != singleton(X26) )
& ( ~ in(esk6_2(X30,X31),X31)
| esk6_2(X30,X31) != X30
| X31 = singleton(X30) )
& ( in(esk6_2(X30,X31),X31)
| esk6_2(X30,X31) = X30
| X31 = singleton(X30) ) ),
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)],[d1_tarski])])])])])]) ).
fof(c_0_8,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ in(X20,X19)
| X20 = X17
| X20 = X18
| X19 != unordered_pair(X17,X18) )
& ( X21 != X17
| in(X21,X19)
| X19 != unordered_pair(X17,X18) )
& ( X21 != X18
| in(X21,X19)
| X19 != unordered_pair(X17,X18) )
& ( esk5_3(X22,X23,X24) != X22
| ~ in(esk5_3(X22,X23,X24),X24)
| X24 = unordered_pair(X22,X23) )
& ( esk5_3(X22,X23,X24) != X23
| ~ in(esk5_3(X22,X23,X24),X24)
| X24 = unordered_pair(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X24)
| esk5_3(X22,X23,X24) = X22
| esk5_3(X22,X23,X24) = X23
| X24 = unordered_pair(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)],[d2_tarski])])])])])]) ).
cnf(c_0_9,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
subset(singleton(esk1_0),unordered_pair(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( in(X1,unordered_pair(esk2_0,esk3_0))
| ~ in(X1,singleton(esk1_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).
cnf(c_0_15,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
in(esk1_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET884+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:45:46 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4xoW4EjLV4/E---3.1_10960.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # new_bool_3 with pid 11038 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 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 11044 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 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 : 9
% 0.16/0.43 # Removed by relevancy pruning/SinE : 2
% 0.16/0.43 # Initial clauses : 19
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 19
% 0.16/0.43 # Processed clauses : 54
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 5
% 0.16/0.43 # ...remaining for further processing : 49
% 0.16/0.43 # Other redundant clauses eliminated : 8
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 0
% 0.16/0.43 # Generated clauses : 36
% 0.16/0.43 # ...of the previous two non-redundant : 26
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 31
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 8
% 0.16/0.43 # Total rewrite steps : 8
% 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 : 25
% 0.16/0.43 # Positive orientable unit clauses : 6
% 0.16/0.43 # Positive unorientable unit clauses: 1
% 0.16/0.43 # Negative unit clauses : 6
% 0.16/0.43 # Non-unit-clauses : 12
% 0.16/0.43 # Current number of unprocessed clauses: 6
% 0.16/0.43 # ...number of literals in the above : 17
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 19
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 22
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 22
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 3
% 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 : 8
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 1338
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.006 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.007 s
% 0.16/0.43 # Maximum resident set size: 1696 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.003 s
% 0.16/0.43 # Total time : 0.009 s
% 0.16/0.43 # Maximum resident set size: 1676 pages
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------