TSTP Solution File: SET886+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:24:38 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 30 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 3 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t27_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),singleton(X3))
=> unordered_pair(X1,X2) = singleton(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.wTgIdySpSV/E---3.1_19766.p',t27_zfmisc_1) ).
fof(t26_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),singleton(X3))
=> X1 = X3 ),
file('/export/starexec/sandbox2/tmp/tmp.wTgIdySpSV/E---3.1_19766.p',t26_zfmisc_1) ).
fof(t69_enumset1,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.wTgIdySpSV/E---3.1_19766.p',t69_enumset1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.wTgIdySpSV/E---3.1_19766.p',commutativity_k2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),singleton(X3))
=> unordered_pair(X1,X2) = singleton(X3) ),
inference(assume_negation,[status(cth)],[t27_zfmisc_1]) ).
fof(c_0_5,plain,
! [X7,X8,X9] :
( ~ subset(unordered_pair(X7,X8),singleton(X9))
| X7 = X9 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_zfmisc_1])])]) ).
fof(c_0_6,plain,
! [X10] : unordered_pair(X10,X10) = singleton(X10),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_7,negated_conjecture,
( subset(unordered_pair(esk1_0,esk2_0),singleton(esk3_0))
& unordered_pair(esk1_0,esk2_0) != singleton(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( X1 = X3
| ~ subset(unordered_pair(X1,X2),singleton(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
subset(unordered_pair(esk1_0,esk2_0),singleton(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X11,X12] : unordered_pair(X11,X12) = unordered_pair(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_12,negated_conjecture,
unordered_pair(esk1_0,esk2_0) != singleton(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ subset(unordered_pair(X1,X3),unordered_pair(X2,X2)) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
subset(unordered_pair(esk1_0,esk2_0),unordered_pair(esk3_0,esk3_0)),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
unordered_pair(esk3_0,esk3_0) != unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( X1 = X2
| ~ subset(unordered_pair(X3,X1),unordered_pair(X2,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(esk1_0,esk2_0) != unordered_pair(esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
esk2_0 = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 09:56:51 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.wTgIdySpSV/E---3.1_19766.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 19913 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.20/0.49 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 19916 completed with status 0
% 0.20/0.49 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 7
% 0.20/0.49 # Removed by relevancy pruning/SinE : 2
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 20
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 18
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 20
% 0.20/0.49 # ...of the previous two non-redundant : 16
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 20
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 11
% 0.20/0.49 # ...of those cached : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 9
% 0.20/0.49 # Positive orientable unit clauses : 6
% 0.20/0.49 # Positive unorientable unit clauses: 1
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 6
% 0.20/0.49 # ...number of literals in the above : 11
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 9
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 4
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 4
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 15
% 0.20/0.49 # BW rewrite match successes : 15
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 409
% 0.20/0.49 # Search garbage collected termcells : 50
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1604 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------