TSTP Solution File: SEU321+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU321+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:58 EDT 2023
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 122 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 131 ( 51 ~; 40 |; 20 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 2 sgn; 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rc5_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ? [X2] :
( element(X2,powerset(the_carrier(X1)))
& ~ empty(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',rc5_struct_0) ).
fof(l40_tops_1,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',l40_tops_1) ).
fof(t50_subset_1,axiom,
! [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.fNByllnzwy/E---3.1_31619.p',t50_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',t5_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',existence_m1_subset_1) ).
fof(t54_subset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(X1))
=> ~ ( in(X2,subset_complement(X1,X3))
& in(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',t54_subset_1) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.fNByllnzwy/E---3.1_31619.p',fc6_membered) ).
fof(c_0_8,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ? [X2] :
( element(X2,powerset(the_carrier(X1)))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[rc5_struct_0]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l40_tops_1])]) ).
fof(c_0_10,plain,
! [X5] :
( ( element(esk1_1(X5),powerset(the_carrier(X5)))
| empty_carrier(X5)
| ~ one_sorted_str(X5) )
& ( ~ empty(esk1_1(X5))
| empty_carrier(X5)
| ~ one_sorted_str(X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,negated_conjecture,
( ~ empty_carrier(esk6_0)
& one_sorted_str(esk6_0)
& element(esk7_0,powerset(the_carrier(esk6_0)))
& element(esk8_0,the_carrier(esk6_0))
& ( ~ in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))
| in(esk8_0,esk7_0) )
& ( in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))
| ~ in(esk8_0,esk7_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [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)],[t50_subset_1]) ).
fof(c_0_13,plain,
! [X35,X36,X37] :
( ~ in(X35,X36)
| ~ element(X36,powerset(X37))
| ~ empty(X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_14,plain,
( element(esk1_1(X1),powerset(the_carrier(X1)))
| empty_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
one_sorted_str(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ empty_carrier(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X33,X34] :
( ~ element(X33,X34)
| empty(X34)
| in(X33,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_18,plain,
! [X45] : element(esk4_1(X45),X45),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_19,plain,
! [X64,X65,X66] :
( X64 = empty_set
| ~ element(X65,powerset(X64))
| ~ element(X66,X64)
| in(X66,X65)
| in(X66,subset_complement(X64,X65)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_20,plain,
! [X67,X68,X69] :
( ~ element(X69,powerset(X67))
| ~ in(X68,subset_complement(X67,X69))
| ~ in(X68,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_subset_1])]) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
element(esk1_1(esk6_0),powerset(the_carrier(esk6_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_23,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( X1 = empty_set
| in(X3,X2)
| in(X3,subset_complement(X1,X2))
| ~ element(X2,powerset(X1))
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( ~ element(X1,powerset(X2))
| ~ in(X3,subset_complement(X2,X1))
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))
| ~ in(esk8_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(X1,esk1_1(esk6_0))
| ~ empty(the_carrier(esk6_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( in(esk4_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( the_carrier(esk6_0) = empty_set
| in(X1,subset_complement(the_carrier(esk6_0),esk7_0))
| in(X1,esk7_0)
| ~ element(X1,the_carrier(esk6_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
element(esk8_0,the_carrier(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
~ in(esk8_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]) ).
cnf(c_0_34,plain,
( empty_carrier(X1)
| ~ empty(esk1_1(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
( empty(esk1_1(esk6_0))
| ~ empty(the_carrier(esk6_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( in(esk8_0,esk7_0)
| ~ in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,negated_conjecture,
( the_carrier(esk6_0) = empty_set
| in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ empty(the_carrier(esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15])]),c_0_16]) ).
cnf(c_0_39,negated_conjecture,
the_carrier(esk6_0) = empty_set,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_33]) ).
cnf(c_0_40,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU321+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 09:12:00 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/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.fNByllnzwy/E---3.1_31619.p
% 0.21/0.55 # Version: 3.1pre001
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31699 completed with status 0
% 0.21/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.21/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.55 # Starting sh5l with 136s (1) cores
% 0.21/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31704 completed with status 0
% 0.21/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.21/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.55 # Preprocessing time : 0.002 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Theorem
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 42
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 84
% 0.21/0.55 # Removed in clause preprocessing : 5
% 0.21/0.55 # Initial clauses in saturation : 79
% 0.21/0.55 # Processed clauses : 712
% 0.21/0.55 # ...of these trivial : 0
% 0.21/0.55 # ...subsumed : 236
% 0.21/0.55 # ...remaining for further processing : 476
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 19
% 0.21/0.55 # Backward-rewritten : 86
% 0.21/0.55 # Generated clauses : 949
% 0.21/0.55 # ...of the previous two non-redundant : 819
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 1
% 0.21/0.55 # Paramodulations : 948
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Total rewrite steps : 61
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 291
% 0.21/0.55 # Positive orientable unit clauses : 21
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 5
% 0.21/0.55 # Non-unit-clauses : 265
% 0.21/0.55 # Current number of unprocessed clauses: 253
% 0.21/0.55 # ...number of literals in the above : 793
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 185
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 23886
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 23328
% 0.21/0.55 # Non-unit clause-clause subsumptions : 214
% 0.21/0.55 # Unit Clause-clause subsumption calls : 155
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 3
% 0.21/0.55 # BW rewrite match successes : 1
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 16022
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.041 s
% 0.21/0.55 # System time : 0.005 s
% 0.21/0.55 # Total time : 0.046 s
% 0.21/0.55 # Maximum resident set size: 1892 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.206 s
% 0.21/0.55 # System time : 0.013 s
% 0.21/0.55 # Total time : 0.219 s
% 0.21/0.55 # Maximum resident set size: 1732 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------