TSTP Solution File: SET047+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:18:09 EDT 2023
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 61 ( 23 ~; 30 |; 4 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel43,conjecture,
! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.4tC9pJy8Pd/E---3.1_346.p',pel43) ).
fof(pel43_1,axiom,
! [X1,X2] :
( set_equal(X1,X2)
<=> ! [X3] :
( element(X3,X1)
<=> element(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.4tC9pJy8Pd/E---3.1_346.p',pel43_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
inference(assume_negation,[status(cth)],[pel43]) ).
fof(c_0_3,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ element(X8,X6)
| element(X8,X7)
| ~ set_equal(X6,X7) )
& ( ~ element(X9,X7)
| element(X9,X6)
| ~ set_equal(X6,X7) )
& ( ~ element(esk3_2(X10,X11),X10)
| ~ element(esk3_2(X10,X11),X11)
| set_equal(X10,X11) )
& ( element(esk3_2(X10,X11),X10)
| element(esk3_2(X10,X11),X11)
| set_equal(X10,X11) ) ),
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)],[pel43_1])])])])])]) ).
fof(c_0_4,negated_conjecture,
( ( ~ set_equal(esk1_0,esk2_0)
| ~ set_equal(esk2_0,esk1_0) )
& ( set_equal(esk1_0,esk2_0)
| set_equal(esk2_0,esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( element(X1,X3)
| ~ element(X1,X2)
| ~ set_equal(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( set_equal(esk1_0,esk2_0)
| set_equal(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( element(X1,X3)
| ~ element(X1,X2)
| ~ set_equal(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( element(X1,esk2_0)
| ~ element(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
( element(esk3_2(X1,X2),X1)
| element(esk3_2(X1,X2),X2)
| set_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( element(esk3_2(esk1_0,X1),esk2_0)
| element(esk3_2(esk1_0,X1),X1)
| set_equal(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( set_equal(X1,X2)
| ~ element(esk3_2(X1,X2),X1)
| ~ element(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( element(esk3_2(esk1_0,esk2_0),esk2_0)
| set_equal(esk1_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( set_equal(esk1_0,esk2_0)
| ~ element(esk3_2(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( element(X1,esk1_0)
| ~ element(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( ~ set_equal(esk1_0,esk2_0)
| ~ set_equal(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
set_equal(esk1_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( element(esk3_2(X1,esk1_0),esk2_0)
| element(esk3_2(X1,esk1_0),X1)
| set_equal(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
~ set_equal(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( set_equal(X1,esk1_0)
| ~ element(esk3_2(X1,esk1_0),esk2_0)
| ~ element(esk3_2(X1,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
element(esk3_2(esk2_0,esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.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:14:40 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 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.4tC9pJy8Pd/E---3.1_346.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 459 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: FGHNF-FFSF22-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 465 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: FGHNF-FFSF22-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 : 2
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 6
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 6
% 0.16/0.43 # Processed clauses : 29
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 4
% 0.16/0.43 # ...remaining for further processing : 25
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 1
% 0.16/0.43 # Backward-rewritten : 5
% 0.16/0.43 # Generated clauses : 30
% 0.16/0.43 # ...of the previous two non-redundant : 21
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 4
% 0.16/0.43 # Paramodulations : 24
% 0.16/0.43 # Factorizations : 6
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Total rewrite steps : 9
% 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 : 13
% 0.16/0.43 # Positive orientable unit clauses : 3
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 1
% 0.16/0.43 # Non-unit-clauses : 9
% 0.16/0.43 # Current number of unprocessed clauses: 2
% 0.16/0.43 # ...number of literals in the above : 4
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 12
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 26
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 21
% 0.16/0.43 # Non-unit clause-clause subsumptions : 8
% 0.16/0.43 # Unit Clause-clause subsumption calls : 6
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 9
% 0.16/0.43 # BW rewrite match successes : 3
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 798
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.005 s
% 0.16/0.43 # Maximum resident set size: 1768 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.005 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: 1680 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------