TSTP Solution File: SEU328+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU328+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:26:13 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 13 unt; 0 def)
% Number of atoms : 60 ( 29 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 23 ~; 15 |; 3 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t48_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',t48_setfam_1) ).
fof(d4_subset_1,axiom,
! [X1] : cast_to_subset(X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',d4_subset_1) ).
fof(t12_tops_2,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_complement(X1,meet_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',t12_tops_2) ).
fof(dt_k2_subset_1,axiom,
! [X1] : element(cast_to_subset(X1),powerset(X1)),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',dt_k2_subset_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',d5_subset_1) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',redefinition_k6_subset_1) ).
fof(dt_k6_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(meet_of_subsets(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.nypAafTqXN/E---3.1_22478.p',dt_k6_setfam_1) ).
fof(c_0_7,plain,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[t48_setfam_1]) ).
fof(c_0_8,plain,
! [X16,X17] :
( ~ element(X17,powerset(powerset(X16)))
| X17 = empty_set
| union_of_subsets(X16,complements_of_subsets(X16,X17)) = subset_difference(X16,cast_to_subset(X16),meet_of_subsets(X16,X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X68] : cast_to_subset(X68) = X68,
inference(variable_rename,[status(thm)],[d4_subset_1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_complement(X1,meet_of_subsets(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t12_tops_2])]) ).
cnf(c_0_11,plain,
( X1 = empty_set
| union_of_subsets(X2,complements_of_subsets(X2,X1)) = subset_difference(X2,cast_to_subset(X2),meet_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
cast_to_subset(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( element(esk2_0,powerset(powerset(esk1_0)))
& esk2_0 != empty_set
& union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X69] : element(cast_to_subset(X69),powerset(X69)),
inference(variable_rename,[status(thm)],[dt_k2_subset_1]) ).
fof(c_0_15,plain,
! [X6,X7] :
( ~ element(X7,powerset(X6))
| subset_complement(X6,X7) = set_difference(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
fof(c_0_16,plain,
! [X62,X63,X64] :
( ~ element(X63,powerset(X62))
| ~ element(X64,powerset(X62))
| subset_difference(X62,X63,X64) = set_difference(X63,X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])])]) ).
cnf(c_0_17,plain,
( subset_difference(X1,X1,meet_of_subsets(X1,X2)) = union_of_subsets(X1,complements_of_subsets(X1,X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
element(esk2_0,powerset(powerset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
element(cast_to_subset(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( subset_complement(X2,X1) = set_difference(X2,X1)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( subset_difference(X2,X1,X3) = set_difference(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
subset_difference(esk1_0,esk1_0,meet_of_subsets(esk1_0,esk2_0)) = union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
element(X1,powerset(X1)),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( set_difference(esk1_0,meet_of_subsets(esk1_0,esk2_0)) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))
| ~ element(meet_of_subsets(esk1_0,esk2_0),powerset(esk1_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,plain,
! [X12,X13] :
( ~ element(X13,powerset(powerset(X12)))
| element(meet_of_subsets(X12,X13),powerset(X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_setfam_1])])]) ).
cnf(c_0_28,negated_conjecture,
~ element(meet_of_subsets(esk1_0,esk2_0),powerset(esk1_0)),
inference(csr,[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]) ).
cnf(c_0_29,plain,
( element(meet_of_subsets(X2,X1),powerset(X2))
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU328+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 08:13:33 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.nypAafTqXN/E---3.1_22478.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # sh5l with pid 22601 completed with status 0
% 0.22/0.53 # Result found by sh5l
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.22/0.53 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22614 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 59
% 0.22/0.53 # Removed by relevancy pruning/SinE : 8
% 0.22/0.53 # Initial clauses : 99
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 99
% 0.22/0.53 # Processed clauses : 420
% 0.22/0.53 # ...of these trivial : 4
% 0.22/0.53 # ...subsumed : 84
% 0.22/0.53 # ...remaining for further processing : 332
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 5
% 0.22/0.53 # Backward-rewritten : 3
% 0.22/0.53 # Generated clauses : 702
% 0.22/0.53 # ...of the previous two non-redundant : 560
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 1
% 0.22/0.53 # Paramodulations : 702
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 190
% 0.22/0.53 # ...of those cached : 144
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 225
% 0.22/0.53 # Positive orientable unit clauses : 41
% 0.22/0.53 # Positive unorientable unit clauses: 2
% 0.22/0.53 # Negative unit clauses : 12
% 0.22/0.53 # Non-unit-clauses : 170
% 0.22/0.53 # Current number of unprocessed clauses: 327
% 0.22/0.53 # ...number of literals in the above : 851
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 107
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 2286
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 2244
% 0.22/0.53 # Non-unit clause-clause subsumptions : 57
% 0.22/0.53 # Unit Clause-clause subsumption calls : 160
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 10
% 0.22/0.53 # BW rewrite match successes : 7
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 12400
% 0.22/0.53 # Search garbage collected termcells : 840
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.023 s
% 0.22/0.53 # System time : 0.005 s
% 0.22/0.53 # Total time : 0.028 s
% 0.22/0.53 # Maximum resident set size: 1932 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.024 s
% 0.22/0.53 # System time : 0.008 s
% 0.22/0.53 # Total time : 0.032 s
% 0.22/0.53 # Maximum resident set size: 1744 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------