TSTP Solution File: SEU290+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU290+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:19 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 146 ( 46 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 176 ( 65 ~; 71 |; 23 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 73 ( 4 sgn; 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| in(apply(X4,X3),relation_rng(X4)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',t6_funct_2) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',cc1_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/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',dt_m2_relset_1) ).
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/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',d1_funct_2) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',d5_funct_1) ).
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/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',redefinition_k4_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/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p',redefinition_m2_relset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| in(apply(X4,X3),relation_rng(X4)) ) ) ),
inference(assume_negation,[status(cth)],[t6_funct_2]) ).
fof(c_0_8,plain,
! [X9,X10,X11] :
( ~ element(X11,powerset(cartesian_product2(X9,X10)))
| relation(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_9,plain,
! [X29,X30,X31] :
( ~ relation_of2_as_subset(X31,X29,X30)
| element(X31,powerset(cartesian_product2(X29,X30))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
fof(c_0_10,plain,
! [X13,X14,X15] :
( ( ~ quasi_total(X15,X13,X14)
| X13 = relation_dom_as_subset(X13,X14,X15)
| X14 = empty_set
| ~ relation_of2_as_subset(X15,X13,X14) )
& ( X13 != relation_dom_as_subset(X13,X14,X15)
| quasi_total(X15,X13,X14)
| X14 = empty_set
| ~ relation_of2_as_subset(X15,X13,X14) )
& ( ~ quasi_total(X15,X13,X14)
| X13 = relation_dom_as_subset(X13,X14,X15)
| X13 != empty_set
| ~ relation_of2_as_subset(X15,X13,X14) )
& ( X13 != relation_dom_as_subset(X13,X14,X15)
| quasi_total(X15,X13,X14)
| X13 != empty_set
| ~ relation_of2_as_subset(X15,X13,X14) )
& ( ~ quasi_total(X15,X13,X14)
| X15 = empty_set
| X13 = empty_set
| X14 != empty_set
| ~ relation_of2_as_subset(X15,X13,X14) )
& ( X15 != empty_set
| quasi_total(X15,X13,X14)
| X13 = empty_set
| X14 != empty_set
| ~ relation_of2_as_subset(X15,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])]) ).
fof(c_0_11,negated_conjecture,
( function(esk24_0)
& quasi_total(esk24_0,esk21_0,esk22_0)
& relation_of2_as_subset(esk24_0,esk21_0,esk22_0)
& in(esk23_0,esk21_0)
& esk22_0 != empty_set
& ~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( in(esk1_3(X16,X17,X18),relation_dom(X16))
| ~ in(X18,X17)
| X17 != relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( X18 = apply(X16,esk1_3(X16,X17,X18))
| ~ in(X18,X17)
| X17 != relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( ~ in(X21,relation_dom(X16))
| X20 != apply(X16,X21)
| in(X20,X17)
| X17 != relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( ~ in(esk2_2(X16,X22),X22)
| ~ in(X24,relation_dom(X16))
| esk2_2(X16,X22) != apply(X16,X24)
| X22 = relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( in(esk3_2(X16,X22),relation_dom(X16))
| in(esk2_2(X16,X22),X22)
| X22 = relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( esk2_2(X16,X22) = apply(X16,esk3_2(X16,X22))
| in(esk2_2(X16,X22),X22)
| X22 = relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_funct_1])])])])])]) ).
cnf(c_0_13,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X67,X68,X69] :
( ~ relation_of2(X69,X67,X68)
| relation_dom_as_subset(X67,X68,X69) = relation_dom(X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
cnf(c_0_16,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_10]) ).
cnf(c_0_17,negated_conjecture,
quasi_total(esk24_0,esk21_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
relation_of2_as_subset(esk24_0,esk21_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
esk22_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( in(X3,X4)
| ~ in(X1,relation_dom(X2))
| X3 != apply(X2,X1)
| X4 != relation_rng(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( relation_dom_as_subset(X2,X3,X1) = relation_dom(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
relation_dom_as_subset(esk21_0,esk22_0,esk24_0) = esk21_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]) ).
fof(c_0_24,plain,
! [X70,X71,X72] :
( ( ~ relation_of2_as_subset(X72,X70,X71)
| relation_of2(X72,X70,X71) )
& ( ~ relation_of2(X72,X70,X71)
| relation_of2_as_subset(X72,X70,X71) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_25,negated_conjecture,
~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
function(esk24_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
relation(esk24_0),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( relation_dom(esk24_0) = esk21_0
| ~ relation_of2(esk24_0,esk21_0,esk22_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
~ in(esk23_0,relation_dom(esk24_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
relation_dom(esk24_0) = esk21_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18])]) ).
cnf(c_0_33,negated_conjecture,
in(esk23_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SEU290+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 07:41:26 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.s1aNXWTYqI/E---3.1_4785.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4865 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.43 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.43 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4875 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.43 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.003 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 55
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 99
% 0.15/0.43 # Removed in clause preprocessing : 10
% 0.15/0.43 # Initial clauses in saturation : 89
% 0.15/0.43 # Processed clauses : 216
% 0.15/0.43 # ...of these trivial : 3
% 0.15/0.43 # ...subsumed : 8
% 0.15/0.43 # ...remaining for further processing : 205
% 0.15/0.43 # Other redundant clauses eliminated : 10
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 13
% 0.15/0.43 # Generated clauses : 104
% 0.15/0.43 # ...of the previous two non-redundant : 81
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 2
% 0.15/0.43 # Paramodulations : 96
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 10
% 0.15/0.43 # Total rewrite steps : 42
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 98
% 0.15/0.43 # Positive orientable unit clauses : 44
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 9
% 0.15/0.43 # Non-unit-clauses : 45
% 0.15/0.43 # Current number of unprocessed clauses: 40
% 0.15/0.43 # ...number of literals in the above : 118
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 100
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 745
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 415
% 0.15/0.43 # Non-unit clause-clause subsumptions : 9
% 0.15/0.43 # Unit Clause-clause subsumption calls : 240
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 10
% 0.15/0.43 # BW rewrite match successes : 6
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 5186
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.013 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.016 s
% 0.15/0.43 # Maximum resident set size: 1900 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.046 s
% 0.15/0.43 # System time : 0.016 s
% 0.15/0.43 # Total time : 0.063 s
% 0.15/0.43 # Maximum resident set size: 1732 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------