TSTP Solution File: SEU107+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU107+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:30:23 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 125 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 129 ( 47 ~; 47 |; 24 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 74 ( 2 sgn; 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rc3_finset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',rc3_finset_1) ).
fof(dt_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',dt_k2_finsub_1) ).
fof(redefinition_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',redefinition_k2_finsub_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',t4_subset) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',t37_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',reflexivity_r1_tarski) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',existence_m1_subset_1) ).
fof(t18_finsub_1,conjecture,
! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> in(empty_set,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p',t18_finsub_1) ).
fof(c_0_9,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
inference(fof_simplification,[status(thm)],[rc3_finset_1]) ).
fof(c_0_10,plain,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[dt_k2_finsub_1]) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( ( ~ empty(X1)
& preboolean(X1)
& element(X2,X1)
& element(X3,X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k2_finsub_1]) ).
fof(c_0_12,plain,
! [X48,X49,X50] :
( ~ in(X48,X49)
| ~ element(X49,powerset(X50))
| element(X48,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_13,plain,
! [X29] :
( ( element(esk9_1(X29),powerset(X29))
| empty(X29) )
& ( ~ empty(esk9_1(X29))
| empty(X29) )
& ( finite(esk9_1(X29))
| empty(X29) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,plain,
! [X11,X12,X13] :
( empty(X11)
| ~ preboolean(X11)
| ~ element(X12,X11)
| ~ element(X13,X11)
| element(prebool_difference(X11,X12,X13),X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_15,plain,
! [X33,X34,X35] :
( empty(X33)
| ~ preboolean(X33)
| ~ element(X34,X33)
| ~ element(X35,X33)
| prebool_difference(X33,X34,X35) = set_difference(X34,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_16,plain,
! [X42,X43] :
( ( set_difference(X42,X43) != empty_set
| subset(X42,X43) )
& ( ~ subset(X42,X43)
| set_difference(X42,X43) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])]) ).
fof(c_0_17,plain,
! [X36] : subset(X36,X36),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_18,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( element(esk9_1(X1),powerset(X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X40,X41] :
( ~ element(X40,X41)
| empty(X41)
| in(X40,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_21,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X2,X1)
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( empty(X1)
| prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ preboolean(X1)
| ~ element(X2,X1)
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,esk9_1(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( empty(X1)
| ~ empty(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X14] : element(esk1_1(X14),X14),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_29,negated_conjecture,
~ ! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> in(empty_set,X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t18_finsub_1])]) ).
cnf(c_0_30,plain,
( element(set_difference(X1,X2),X3)
| empty(X3)
| ~ element(X2,X3)
| ~ element(X1,X3)
| ~ preboolean(X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
set_difference(X1,X1) = empty_set,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( element(X1,X2)
| empty(X2)
| ~ element(X1,esk9_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
element(esk1_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,negated_conjecture,
( ~ empty(esk11_0)
& preboolean(esk11_0)
& ~ in(empty_set,esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_35,plain,
( element(empty_set,X1)
| empty(X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( element(esk1_1(esk9_1(X1)),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ in(empty_set,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
( element(empty_set,X1)
| empty(X1)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
preboolean(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
~ element(empty_set,esk11_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU107+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:51:05 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.prM8RZIi4n/E---3.1_31339.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31416 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.17/0.46 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 31424 completed with status 0
% 0.17/0.46 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 33
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 58
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 58
% 0.17/0.46 # Processed clauses : 194
% 0.17/0.46 # ...of these trivial : 2
% 0.17/0.46 # ...subsumed : 46
% 0.17/0.46 # ...remaining for further processing : 146
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 7
% 0.17/0.46 # Backward-rewritten : 13
% 0.17/0.46 # Generated clauses : 312
% 0.17/0.46 # ...of the previous two non-redundant : 244
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 7
% 0.17/0.46 # Paramodulations : 311
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 1
% 0.17/0.46 # Total rewrite steps : 92
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 126
% 0.17/0.46 # Positive orientable unit clauses : 32
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 13
% 0.17/0.46 # Non-unit-clauses : 81
% 0.17/0.46 # Current number of unprocessed clauses: 94
% 0.17/0.46 # ...number of literals in the above : 411
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 20
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 1329
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 821
% 0.17/0.46 # Non-unit clause-clause subsumptions : 49
% 0.17/0.46 # Unit Clause-clause subsumption calls : 269
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 13
% 0.17/0.46 # BW rewrite match successes : 3
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 6514
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.013 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.016 s
% 0.17/0.46 # Maximum resident set size: 1816 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.059 s
% 0.17/0.46 # System time : 0.012 s
% 0.17/0.46 # Total time : 0.071 s
% 0.17/0.46 # Maximum resident set size: 1700 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------