TSTP Solution File: SET927+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET927+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:21:20 EDT 2023
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 69 ( 36 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 76 ( 28 ~; 34 |; 10 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 1 sgn; 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l39_zfmisc_1,axiom,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rHpRfqhGTQ/E---3.1_1401.p',l39_zfmisc_1) ).
fof(t70_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rHpRfqhGTQ/E---3.1_1401.p',t70_zfmisc_1) ).
fof(c_0_2,plain,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
inference(fof_simplification,[status(thm)],[l39_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t70_zfmisc_1])]) ).
fof(c_0_4,plain,
! [X9,X10,X11] :
( ( ~ in(X9,X11)
| set_difference(unordered_pair(X9,X10),X11) != singleton(X9) )
& ( in(X10,X11)
| X9 = X10
| set_difference(unordered_pair(X9,X10),X11) != singleton(X9) )
& ( ~ in(X10,X11)
| in(X9,X11)
| set_difference(unordered_pair(X9,X10),X11) = singleton(X9) )
& ( X9 != X10
| in(X9,X11)
| set_difference(unordered_pair(X9,X10),X11) = singleton(X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
( ( ~ in(esk2_0,esk3_0)
| in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != singleton(esk1_0) )
& ( esk1_0 != esk2_0
| in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != singleton(esk1_0) )
& ( ~ in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0) )
& ( in(esk2_0,esk3_0)
| esk1_0 = esk2_0
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( ~ in(X1,X2)
| set_difference(unordered_pair(X1,X3),X2) != singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0)
| ~ in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| X3 = X1
| set_difference(unordered_pair(X3,X1),X2) != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( in(esk2_0,esk3_0)
| esk1_0 = esk2_0
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( in(esk1_0,esk3_0)
| ~ in(esk2_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != singleton(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( in(X3,X2)
| set_difference(unordered_pair(X3,X1),X2) = singleton(X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ in(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( esk2_0 = esk1_0
| in(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ in(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( in(esk1_0,esk3_0)
| esk1_0 != esk2_0
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != singleton(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk1_0,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( in(X1,X3)
| set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
set_difference(unordered_pair(esk1_0,esk1_0),esk3_0) != singleton(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16])]),c_0_12]) ).
cnf(c_0_19,plain,
( set_difference(unordered_pair(X1,X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET927+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n016.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 18:16:06 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.rHpRfqhGTQ/E---3.1_1401.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 1481 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 1484 completed with status 0
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 6
% 0.18/0.47 # Removed by relevancy pruning/SinE : 2
% 0.18/0.47 # Initial clauses : 10
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 10
% 0.18/0.47 # Processed clauses : 35
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 7
% 0.18/0.47 # ...remaining for further processing : 28
% 0.18/0.47 # Other redundant clauses eliminated : 1
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 3
% 0.18/0.47 # Backward-rewritten : 3
% 0.18/0.47 # Generated clauses : 32
% 0.18/0.47 # ...of the previous two non-redundant : 23
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 30
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 1
% 0.18/0.47 # Total rewrite steps : 5
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 10
% 0.18/0.47 # Positive orientable unit clauses : 1
% 0.18/0.47 # Positive unorientable unit clauses: 1
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 6
% 0.18/0.47 # Current number of unprocessed clauses: 5
% 0.18/0.47 # ...number of literals in the above : 15
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 17
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 29
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 24
% 0.18/0.47 # Non-unit clause-clause subsumptions : 6
% 0.18/0.47 # Unit Clause-clause subsumption calls : 4
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 5
% 0.18/0.47 # BW rewrite match successes : 5
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 932
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.004 s
% 0.18/0.47 # System time : 0.000 s
% 0.18/0.47 # Total time : 0.004 s
% 0.18/0.47 # Maximum resident set size: 1764 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.004 s
% 0.18/0.47 # System time : 0.002 s
% 0.18/0.47 # Total time : 0.006 s
% 0.18/0.47 # Maximum resident set size: 1672 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------