TSTP Solution File: SEU171+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.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:25:05 EDT 2023
% Result : Theorem 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 100 ( 20 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 112 ( 40 ~; 34 |; 16 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t50_subset_1,conjecture,
! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p',t50_subset_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p',d2_subset_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p',d5_subset_1) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p',d4_xboole_0) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p',t6_boole) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t50_subset_1])]) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_7,plain,
! [X114,X115] :
( ~ element(X115,powerset(X114))
| subset_complement(X114,X115) = set_difference(X114,X115) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])]) ).
fof(c_0_8,negated_conjecture,
( esk1_0 != empty_set
& element(esk2_0,powerset(esk1_0))
& element(esk3_0,esk1_0)
& ~ in(esk3_0,esk2_0)
& ~ in(esk3_0,subset_complement(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_10,plain,
! [X30,X31] :
( ( ~ element(X31,X30)
| in(X31,X30)
| empty(X30) )
& ( ~ in(X31,X30)
| element(X31,X30)
| empty(X30) )
& ( ~ element(X31,X30)
| empty(X31)
| ~ empty(X30) )
& ( ~ empty(X31)
| element(X31,X30)
| ~ empty(X30) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( subset_complement(X2,X1) = set_difference(X2,X1)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X65,X66,X67,X68,X69,X70,X71,X72] :
( ( in(X68,X65)
| ~ in(X68,X67)
| X67 != set_difference(X65,X66) )
& ( ~ in(X68,X66)
| ~ in(X68,X67)
| X67 != set_difference(X65,X66) )
& ( ~ in(X69,X65)
| in(X69,X66)
| in(X69,X67)
| X67 != set_difference(X65,X66) )
& ( ~ in(esk11_3(X70,X71,X72),X72)
| ~ in(esk11_3(X70,X71,X72),X70)
| in(esk11_3(X70,X71,X72),X71)
| X72 = set_difference(X70,X71) )
& ( in(esk11_3(X70,X71,X72),X70)
| in(esk11_3(X70,X71,X72),X72)
| X72 = set_difference(X70,X71) )
& ( ~ in(esk11_3(X70,X71,X72),X71)
| in(esk11_3(X70,X71,X72),X72)
| X72 = set_difference(X70,X71) ) ),
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)],[c_0_9])])])])])]) ).
fof(c_0_14,plain,
! [X148] :
( ~ empty(X148)
| X148 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
element(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
~ in(esk3_0,subset_complement(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
subset_complement(esk1_0,esk2_0) = set_difference(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( empty(esk1_0)
| in(esk3_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk3_0,set_difference(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
in(esk3_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 08:16:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.7wpxXHXei8/E---3.1_24812.p
% 0.20/0.57 # Version: 3.1pre001
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # sh5l with pid 24926 completed with status 0
% 0.20/0.57 # Result found by sh5l
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.57 # Search class: FGHSM-FFLS32-SFFFFFNN
% 0.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.57 # SAT001_MinMin_p005000_rr_RG with pid 24934 completed with status 0
% 0.20/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.57 # Search class: FGHSM-FFLS32-SFFFFFNN
% 0.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.57 # Preprocessing time : 0.003 s
% 0.20/0.57 # Presaturation interreduction done
% 0.20/0.57
% 0.20/0.57 # Proof found!
% 0.20/0.57 # SZS status Theorem
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57 # Parsed axioms : 111
% 0.20/0.57 # Removed by relevancy pruning/SinE : 17
% 0.20/0.57 # Initial clauses : 170
% 0.20/0.57 # Removed in clause preprocessing : 0
% 0.20/0.57 # Initial clauses in saturation : 170
% 0.20/0.57 # Processed clauses : 1029
% 0.20/0.57 # ...of these trivial : 10
% 0.20/0.57 # ...subsumed : 505
% 0.20/0.57 # ...remaining for further processing : 514
% 0.20/0.57 # Other redundant clauses eliminated : 54
% 0.20/0.57 # Clauses deleted for lack of memory : 0
% 0.20/0.57 # Backward-subsumed : 37
% 0.20/0.57 # Backward-rewritten : 16
% 0.20/0.57 # Generated clauses : 1859
% 0.20/0.57 # ...of the previous two non-redundant : 1462
% 0.20/0.57 # ...aggressively subsumed : 0
% 0.20/0.57 # Contextual simplify-reflections : 2
% 0.20/0.57 # Paramodulations : 1803
% 0.20/0.57 # Factorizations : 0
% 0.20/0.57 # NegExts : 0
% 0.20/0.57 # Equation resolutions : 58
% 0.20/0.57 # Total rewrite steps : 482
% 0.20/0.57 # Propositional unsat checks : 0
% 0.20/0.57 # Propositional check models : 0
% 0.20/0.57 # Propositional check unsatisfiable : 0
% 0.20/0.57 # Propositional clauses : 0
% 0.20/0.57 # Propositional clauses after purity: 0
% 0.20/0.57 # Propositional unsat core size : 0
% 0.20/0.57 # Propositional preprocessing time : 0.000
% 0.20/0.57 # Propositional encoding time : 0.000
% 0.20/0.57 # Propositional solver time : 0.000
% 0.20/0.57 # Success case prop preproc time : 0.000
% 0.20/0.57 # Success case prop encoding time : 0.000
% 0.20/0.57 # Success case prop solver time : 0.000
% 0.20/0.57 # Current number of processed clauses : 277
% 0.20/0.57 # Positive orientable unit clauses : 66
% 0.20/0.57 # Positive unorientable unit clauses: 3
% 0.20/0.57 # Negative unit clauses : 54
% 0.20/0.57 # Non-unit-clauses : 154
% 0.20/0.57 # Current number of unprocessed clauses: 711
% 0.20/0.57 # ...number of literals in the above : 1693
% 0.20/0.57 # Current number of archived formulas : 0
% 0.20/0.57 # Current number of archived clauses : 207
% 0.20/0.57 # Clause-clause subsumption calls (NU) : 11391
% 0.20/0.57 # Rec. Clause-clause subsumption calls : 9197
% 0.20/0.57 # Non-unit clause-clause subsumptions : 187
% 0.20/0.57 # Unit Clause-clause subsumption calls : 1754
% 0.20/0.57 # Rewrite failures with RHS unbound : 0
% 0.20/0.57 # BW rewrite match attempts : 94
% 0.20/0.57 # BW rewrite match successes : 64
% 0.20/0.57 # Condensation attempts : 0
% 0.20/0.57 # Condensation successes : 0
% 0.20/0.57 # Termbank termtop insertions : 23534
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.057 s
% 0.20/0.57 # System time : 0.005 s
% 0.20/0.57 # Total time : 0.062 s
% 0.20/0.57 # Maximum resident set size: 2308 pages
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.059 s
% 0.20/0.57 # System time : 0.007 s
% 0.20/0.57 # Total time : 0.066 s
% 0.20/0.57 # Maximum resident set size: 1776 pages
% 0.20/0.57 % E---3.1 exiting
% 0.20/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------