TSTP Solution File: SEU292+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU292+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:40 EDT 2023
% Result : Theorem 38.93s 5.41s
% Output : CNFRefutation 38.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 138 ( 39 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 149 ( 52 ~; 53 |; 24 &)
% ( 5 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 76 ( 4 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ! [X5] :
( ( relation(X5)
& function(X5) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',t21_funct_2) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) )
& ( X2 = empty_set
=> ( X1 = empty_set
| ( quasi_total(X3,X1,X2)
<=> X3 = empty_set ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',d1_funct_2) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',redefinition_k4_relset_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.RXVAEK0sa4/E---3.1_15804.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.RXVAEK0sa4/E---3.1_15804.p',redefinition_m2_relset_1) ).
fof(t23_funct_1,lemma,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',t23_funct_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',cc1_relset_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p',t3_subset) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ! [X5] :
( ( relation(X5)
& function(X5) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3)) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_funct_2]) ).
fof(c_0_9,plain,
! [X134,X135,X136] :
( ( ~ quasi_total(X136,X134,X135)
| X134 = relation_dom_as_subset(X134,X135,X136)
| X135 = empty_set
| ~ relation_of2_as_subset(X136,X134,X135) )
& ( X134 != relation_dom_as_subset(X134,X135,X136)
| quasi_total(X136,X134,X135)
| X135 = empty_set
| ~ relation_of2_as_subset(X136,X134,X135) )
& ( ~ quasi_total(X136,X134,X135)
| X134 = relation_dom_as_subset(X134,X135,X136)
| X134 != empty_set
| ~ relation_of2_as_subset(X136,X134,X135) )
& ( X134 != relation_dom_as_subset(X134,X135,X136)
| quasi_total(X136,X134,X135)
| X134 != empty_set
| ~ relation_of2_as_subset(X136,X134,X135) )
& ( ~ quasi_total(X136,X134,X135)
| X136 = empty_set
| X134 = empty_set
| X135 != empty_set
| ~ relation_of2_as_subset(X136,X134,X135) )
& ( X136 != empty_set
| quasi_total(X136,X134,X135)
| X134 = empty_set
| X135 != empty_set
| ~ relation_of2_as_subset(X136,X134,X135) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])]) ).
fof(c_0_10,negated_conjecture,
( function(esk233_0)
& quasi_total(esk233_0,esk230_0,esk231_0)
& relation_of2_as_subset(esk233_0,esk230_0,esk231_0)
& relation(esk234_0)
& function(esk234_0)
& in(esk232_0,esk230_0)
& esk231_0 != empty_set
& apply(relation_composition(esk233_0,esk234_0),esk232_0) != apply(esk234_0,apply(esk233_0,esk232_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X614,X615,X616] :
( ~ relation_of2(X616,X614,X615)
| relation_dom_as_subset(X614,X615,X616) = relation_dom(X616) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
cnf(c_0_12,plain,
( X2 = relation_dom_as_subset(X2,X3,X1)
| X3 = empty_set
| ~ quasi_total(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
quasi_total(esk233_0,esk230_0,esk231_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation_of2_as_subset(esk233_0,esk230_0,esk231_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
esk231_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X160,X161,X162] :
( ( ~ relation_of2(X162,X160,X161)
| subset(X162,cartesian_product2(X160,X161)) )
& ( ~ subset(X162,cartesian_product2(X160,X161))
| relation_of2(X162,X160,X161) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relset_1])]) ).
fof(c_0_17,plain,
! [X627,X628,X629] :
( ( ~ relation_of2_as_subset(X629,X627,X628)
| relation_of2(X629,X627,X628) )
& ( ~ relation_of2(X629,X627,X628)
| relation_of2_as_subset(X629,X627,X628) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
fof(c_0_18,lemma,
! [X998,X999,X1000] :
( ~ relation(X999)
| ~ function(X999)
| ~ relation(X1000)
| ~ function(X1000)
| ~ in(X998,relation_dom(X999))
| apply(relation_composition(X999,X1000),X998) = apply(X1000,apply(X999,X998)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])]) ).
cnf(c_0_19,plain,
( relation_dom_as_subset(X2,X3,X1) = relation_dom(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
relation_dom_as_subset(esk230_0,esk231_0,esk233_0) = esk230_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
fof(c_0_21,plain,
! [X26,X27,X28] :
( ~ element(X28,powerset(cartesian_product2(X26,X27)))
| relation(X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_22,plain,
! [X1089,X1090] :
( ( ~ element(X1089,powerset(X1090))
| subset(X1089,X1090) )
& ( ~ subset(X1089,X1090)
| element(X1089,powerset(X1090)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
cnf(c_0_23,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
apply(relation_composition(esk233_0,esk234_0),esk232_0) != apply(esk234_0,apply(esk233_0,esk232_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
relation(esk234_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
function(esk234_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
function(esk233_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( relation_dom(esk233_0) = esk230_0
| ~ relation_of2(esk233_0,esk230_0,esk231_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ relation(esk233_0)
| ~ in(esk232_0,relation_dom(esk233_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
relation_dom(esk233_0) = esk230_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_14])]) ).
cnf(c_0_36,negated_conjecture,
in(esk232_0,esk230_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
( relation(X1)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
subset(esk233_0,cartesian_product2(esk230_0,esk231_0)),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_39,negated_conjecture,
~ relation(esk233_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU292+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 08:09:05 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RXVAEK0sa4/E---3.1_15804.p
% 38.93/5.41 # Version: 3.1pre001
% 38.93/5.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 38.93/5.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.93/5.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.93/5.41 # Starting new_bool_3 with 300s (1) cores
% 38.93/5.41 # Starting new_bool_1 with 300s (1) cores
% 38.93/5.41 # Starting sh5l with 300s (1) cores
% 38.93/5.41 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15882 completed with status 0
% 38.93/5.41 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 38.93/5.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 38.93/5.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.93/5.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.93/5.41 # No SInE strategy applied
% 38.93/5.41 # Search class: FGHSM-SMLM32-MFFFFFNN
% 38.93/5.41 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 38.93/5.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 38.93/5.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 38.93/5.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 113s (1) cores
% 38.93/5.41 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 38.93/5.41 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 38.93/5.41 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 15893 completed with status 0
% 38.93/5.41 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 38.93/5.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 38.93/5.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.93/5.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.93/5.41 # No SInE strategy applied
% 38.93/5.41 # Search class: FGHSM-SMLM32-MFFFFFNN
% 38.93/5.41 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 38.93/5.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 38.93/5.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 38.93/5.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 113s (1) cores
% 38.93/5.41 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 38.93/5.41 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 38.93/5.41 # Preprocessing time : 0.031 s
% 38.93/5.41
% 38.93/5.41 # Proof found!
% 38.93/5.41 # SZS status Theorem
% 38.93/5.41 # SZS output start CNFRefutation
% See solution above
% 38.93/5.41 # Parsed axioms : 385
% 38.93/5.41 # Removed by relevancy pruning/SinE : 0
% 38.93/5.41 # Initial clauses : 1458
% 38.93/5.41 # Removed in clause preprocessing : 35
% 38.93/5.41 # Initial clauses in saturation : 1423
% 38.93/5.41 # Processed clauses : 6398
% 38.93/5.41 # ...of these trivial : 83
% 38.93/5.41 # ...subsumed : 2548
% 38.93/5.41 # ...remaining for further processing : 3767
% 38.93/5.41 # Other redundant clauses eliminated : 422
% 38.93/5.41 # Clauses deleted for lack of memory : 0
% 38.93/5.41 # Backward-subsumed : 168
% 38.93/5.41 # Backward-rewritten : 144
% 38.93/5.41 # Generated clauses : 139037
% 38.93/5.41 # ...of the previous two non-redundant : 135093
% 38.93/5.41 # ...aggressively subsumed : 0
% 38.93/5.41 # Contextual simplify-reflections : 278
% 38.93/5.41 # Paramodulations : 138202
% 38.93/5.41 # Factorizations : 194
% 38.93/5.41 # NegExts : 0
% 38.93/5.41 # Equation resolutions : 673
% 38.93/5.41 # Total rewrite steps : 13971
% 38.93/5.41 # Propositional unsat checks : 0
% 38.93/5.41 # Propositional check models : 0
% 38.93/5.41 # Propositional check unsatisfiable : 0
% 38.93/5.41 # Propositional clauses : 0
% 38.93/5.41 # Propositional clauses after purity: 0
% 38.93/5.41 # Propositional unsat core size : 0
% 38.93/5.41 # Propositional preprocessing time : 0.000
% 38.93/5.41 # Propositional encoding time : 0.000
% 38.93/5.41 # Propositional solver time : 0.000
% 38.93/5.41 # Success case prop preproc time : 0.000
% 38.93/5.41 # Success case prop encoding time : 0.000
% 38.93/5.41 # Success case prop solver time : 0.000
% 38.93/5.41 # Current number of processed clauses : 3346
% 38.93/5.41 # Positive orientable unit clauses : 207
% 38.93/5.41 # Positive unorientable unit clauses: 3
% 38.93/5.41 # Negative unit clauses : 124
% 38.93/5.41 # Non-unit-clauses : 3012
% 38.93/5.41 # Current number of unprocessed clauses: 129618
% 38.93/5.41 # ...number of literals in the above : 696627
% 38.93/5.41 # Current number of archived formulas : 0
% 38.93/5.41 # Current number of archived clauses : 320
% 38.93/5.41 # Clause-clause subsumption calls (NU) : 1993670
% 38.93/5.41 # Rec. Clause-clause subsumption calls : 467051
% 38.93/5.41 # Non-unit clause-clause subsumptions : 1995
% 38.93/5.41 # Unit Clause-clause subsumption calls : 105682
% 38.93/5.41 # Rewrite failures with RHS unbound : 0
% 38.93/5.41 # BW rewrite match attempts : 147
% 38.93/5.41 # BW rewrite match successes : 117
% 38.93/5.41 # Condensation attempts : 0
% 38.93/5.41 # Condensation successes : 0
% 38.93/5.41 # Termbank termtop insertions : 2883617
% 38.93/5.41
% 38.93/5.41 # -------------------------------------------------
% 38.93/5.41 # User time : 4.689 s
% 38.93/5.41 # System time : 0.127 s
% 38.93/5.41 # Total time : 4.817 s
% 38.93/5.41 # Maximum resident set size: 5804 pages
% 38.93/5.41
% 38.93/5.41 # -------------------------------------------------
% 38.93/5.41 # User time : 23.166 s
% 38.93/5.41 # System time : 0.699 s
% 38.93/5.41 # Total time : 23.865 s
% 38.93/5.41 # Maximum resident set size: 2168 pages
% 38.93/5.41 % E---3.1 exiting
% 38.93/5.41 % E---3.1 exiting
%------------------------------------------------------------------------------