TSTP Solution File: SEU263+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU263+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:31:13 EDT 2023
% Result : Theorem 1202.88s 152.11s
% Output : CNFRefutation 1202.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 73 ( 28 ~; 25 |; 8 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 80 ( 3 sgn; 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_relset_1,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',t14_relset_1) ).
fof(t119_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',t119_zfmisc_1) ).
fof(t12_relset_1,lemma,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',t12_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',dt_m2_relset_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',t1_xboole_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',cc1_relset_1) ).
fof(t21_relat_1,lemma,
! [X1] :
( relation(X1)
=> subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',t21_relat_1) ).
fof(d1_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
<=> subset(X3,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',d1_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Ro2EsBtO6i/E---3.1_15393.p',redefinition_m2_relset_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[t14_relset_1]) ).
fof(c_0_10,lemma,
! [X257,X258,X259,X260] :
( ~ subset(X257,X258)
| ~ subset(X259,X260)
| subset(cartesian_product2(X257,X259),cartesian_product2(X258,X260)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t119_zfmisc_1])]) ).
fof(c_0_11,negated_conjecture,
( relation_of2_as_subset(esk4_0,esk3_0,esk1_0)
& subset(relation_rng(esk4_0),esk2_0)
& ~ relation_of2_as_subset(esk4_0,esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,lemma,
! [X20,X21,X22] :
( ( subset(relation_dom(X22),X20)
| ~ relation_of2_as_subset(X22,X20,X21) )
& ( subset(relation_rng(X22),X21)
| ~ relation_of2_as_subset(X22,X20,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])]) ).
cnf(c_0_13,lemma,
( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))
| ~ subset(X1,X2)
| ~ subset(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
subset(relation_rng(esk4_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,lemma,
( subset(relation_dom(X1),X2)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
relation_of2_as_subset(esk4_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X11,X12,X13] :
( ~ relation_of2_as_subset(X13,X11,X12)
| element(X13,powerset(cartesian_product2(X11,X12))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
fof(c_0_18,lemma,
! [X61,X62,X63] :
( ~ subset(X61,X62)
| ~ subset(X62,X63)
| subset(X61,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_19,negated_conjecture,
( subset(cartesian_product2(X1,relation_rng(esk4_0)),cartesian_product2(X2,esk2_0))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
subset(relation_dom(esk4_0),esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X178,X179,X180] :
( ~ element(X180,powerset(cartesian_product2(X178,X179)))
| relation(X180) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_22,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
subset(cartesian_product2(relation_dom(esk4_0),relation_rng(esk4_0)),cartesian_product2(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,lemma,
! [X160] :
( ~ relation(X160)
| subset(X160,cartesian_product2(relation_dom(X160),relation_rng(X160))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_relat_1])]) ).
cnf(c_0_26,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
element(esk4_0,powerset(cartesian_product2(esk3_0,esk1_0))),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
fof(c_0_28,plain,
! [X222,X223,X224] :
( ( ~ relation_of2(X224,X222,X223)
| subset(X224,cartesian_product2(X222,X223)) )
& ( ~ subset(X224,cartesian_product2(X222,X223))
| relation_of2(X224,X222,X223) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relset_1])]) ).
cnf(c_0_29,lemma,
( subset(X1,cartesian_product2(esk3_0,esk2_0))
| ~ subset(X1,cartesian_product2(relation_dom(esk4_0),relation_rng(esk4_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,lemma,
( subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
relation(esk4_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_32,plain,
! [X17,X18,X19] :
( ( ~ relation_of2_as_subset(X19,X17,X18)
| relation_of2(X19,X17,X18) )
& ( ~ relation_of2(X19,X17,X18)
| relation_of2_as_subset(X19,X17,X18) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_33,plain,
( relation_of2(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,lemma,
subset(esk4_0,cartesian_product2(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,lemma,
relation_of2(esk4_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ relation_of2_as_subset(esk4_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU263+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:57:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.Ro2EsBtO6i/E---3.1_15393.p
% 1202.88/152.11 # Version: 3.1pre001
% 1202.88/152.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1202.88/152.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1202.88/152.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1202.88/152.11 # Starting new_bool_3 with 300s (1) cores
% 1202.88/152.11 # Starting new_bool_1 with 300s (1) cores
% 1202.88/152.11 # Starting sh5l with 300s (1) cores
% 1202.88/152.11 # sh5l with pid 15534 completed with status 0
% 1202.88/152.11 # Result found by sh5l
% 1202.88/152.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1202.88/152.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1202.88/152.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1202.88/152.11 # Starting new_bool_3 with 300s (1) cores
% 1202.88/152.11 # Starting new_bool_1 with 300s (1) cores
% 1202.88/152.11 # Starting sh5l with 300s (1) cores
% 1202.88/152.11 # SinE strategy is gf500_gu_R04_F100_L20000
% 1202.88/152.11 # Search class: FGHSM-FSLM32-MFFFFFNN
% 1202.88/152.11 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 1202.88/152.11 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 1202.88/152.11 # G-E--_303_C18_F1_URBAN_S0Y with pid 15550 completed with status 7
% 1202.88/152.11 # Starting sh5l with 31s (1) cores
% 1202.88/152.11 # sh5l with pid 16403 completed with status 7
% 1202.88/152.11 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 1202.88/152.11 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 17692 completed with status 7
% 1202.88/152.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 1202.88/152.11 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 18985 completed with status 7
% 1202.88/152.11 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 25s (1) cores
% 1202.88/152.11 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with pid 20294 completed with status 7
% 1202.88/152.11 # Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 25s (1) cores
% 1202.88/152.11 # G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 20959 completed with status 0
% 1202.88/152.11 # Result found by G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 1202.88/152.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1202.88/152.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1202.88/152.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1202.88/152.11 # Starting new_bool_3 with 300s (1) cores
% 1202.88/152.11 # Starting new_bool_1 with 300s (1) cores
% 1202.88/152.11 # Starting sh5l with 300s (1) cores
% 1202.88/152.11 # SinE strategy is gf500_gu_R04_F100_L20000
% 1202.88/152.11 # Search class: FGHSM-FSLM32-MFFFFFNN
% 1202.88/152.11 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 1202.88/152.11 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 1202.88/152.11 # G-E--_303_C18_F1_URBAN_S0Y with pid 15550 completed with status 7
% 1202.88/152.11 # Starting sh5l with 31s (1) cores
% 1202.88/152.11 # sh5l with pid 16403 completed with status 7
% 1202.88/152.11 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 1202.88/152.11 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 17692 completed with status 7
% 1202.88/152.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 1202.88/152.11 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 18985 completed with status 7
% 1202.88/152.11 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 25s (1) cores
% 1202.88/152.11 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with pid 20294 completed with status 7
% 1202.88/152.11 # Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 25s (1) cores
% 1202.88/152.11 # Preprocessing time : 0.006 s
% 1202.88/152.11 # Presaturation interreduction done
% 1202.88/152.11
% 1202.88/152.11 # Proof found!
% 1202.88/152.11 # SZS status Theorem
% 1202.88/152.11 # SZS output start CNFRefutation
% See solution above
% 1202.88/152.11 # Parsed axioms : 330
% 1202.88/152.11 # Removed by relevancy pruning/SinE : 26
% 1202.88/152.11 # Initial clauses : 659
% 1202.88/152.11 # Removed in clause preprocessing : 4
% 1202.88/152.11 # Initial clauses in saturation : 655
% 1202.88/152.11 # Processed clauses : 83236
% 1202.88/152.11 # ...of these trivial : 1368
% 1202.88/152.11 # ...subsumed : 63372
% 1202.88/152.11 # ...remaining for further processing : 18496
% 1202.88/152.11 # Other redundant clauses eliminated : 732
% 1202.88/152.11 # Clauses deleted for lack of memory : 0
% 1202.88/152.11 # Backward-subsumed : 1160
% 1202.88/152.11 # Backward-rewritten : 263
% 1202.88/152.11 # Generated clauses : 988491
% 1202.88/152.11 # ...of the previous two non-redundant : 950447
% 1202.88/152.11 # ...aggressively subsumed : 0
% 1202.88/152.11 # Contextual simplify-reflections : 326
% 1202.88/152.11 # Paramodulations : 987425
% 1202.88/152.11 # Factorizations : 75
% 1202.88/152.11 # NegExts : 0
% 1202.88/152.11 # Equation resolutions : 902
% 1202.88/152.11 # Total rewrite steps : 110664
% 1202.88/152.11 # Propositional unsat checks : 0
% 1202.88/152.11 # Propositional check models : 0
% 1202.88/152.11 # Propositional check unsatisfiable : 0
% 1202.88/152.11 # Propositional clauses : 0
% 1202.88/152.11 # Propositional clauses after purity: 0
% 1202.88/152.11 # Propositional unsat core size : 0
% 1202.88/152.11 # Propositional preprocessing time : 0.000
% 1202.88/152.11 # Propositional encoding time : 0.000
% 1202.88/152.11 # Propositional solver time : 0.000
% 1202.88/152.11 # Success case prop preproc time : 0.000
% 1202.88/152.11 # Success case prop encoding time : 0.000
% 1202.88/152.11 # Success case prop solver time : 0.000
% 1202.88/152.11 # Current number of processed clauses : 16378
% 1202.88/152.11 # Positive orientable unit clauses : 2395
% 1202.88/152.11 # Positive unorientable unit clauses: 7
% 1202.88/152.11 # Negative unit clauses : 3545
% 1202.88/152.11 # Non-unit-clauses : 10431
% 1202.88/152.11 # Current number of unprocessed clauses: 867506
% 1202.88/152.11 # ...number of literals in the above : 3129661
% 1202.88/152.11 # Current number of archived formulas : 0
% 1202.88/152.11 # Current number of archived clauses : 2090
% 1202.88/152.11 # Clause-clause subsumption calls (NU) : 13568772
% 1202.88/152.11 # Rec. Clause-clause subsumption calls : 8714466
% 1202.88/152.11 # Non-unit clause-clause subsumptions : 19180
% 1202.88/152.11 # Unit Clause-clause subsumption calls : 3959910
% 1202.88/152.11 # Rewrite failures with RHS unbound : 0
% 1202.88/152.11 # BW rewrite match attempts : 3643
% 1202.88/152.11 # BW rewrite match successes : 133
% 1202.88/152.11 # Condensation attempts : 0
% 1202.88/152.11 # Condensation successes : 0
% 1202.88/152.11 # Termbank termtop insertions : 14496142
% 1202.88/152.11
% 1202.88/152.11 # -------------------------------------------------
% 1202.88/152.11 # User time : 146.988 s
% 1202.88/152.11 # System time : 3.260 s
% 1202.88/152.11 # Total time : 150.248 s
% 1202.88/152.11 # Maximum resident set size: 4144 pages
% 1202.88/152.11
% 1202.88/152.11 # -------------------------------------------------
% 1202.88/152.11 # User time : 146.999 s
% 1202.88/152.11 # System time : 3.265 s
% 1202.88/152.11 # Total time : 150.264 s
% 1202.88/152.11 # Maximum resident set size: 2048 pages
% 1202.88/152.11 % E---3.1 exiting
%------------------------------------------------------------------------------