TSTP Solution File: SET995+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET995+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:21:29 EDT 2023
% Result : Theorem 0.60s 0.55s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 158 ( 65 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 202 ( 76 ~; 82 |; 29 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn; 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.cf8NECqnJN/E---3.1_9162.p',d1_tarski) ).
fof(t17_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( relation_dom(X2) = relation_dom(X3)
& relation_rng(X2) = singleton(X1)
& relation_rng(X3) = singleton(X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cf8NECqnJN/E---3.1_9162.p',t17_funct_1) ).
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/sandbox2/tmp/tmp.cf8NECqnJN/E---3.1_9162.p',d5_funct_1) ).
fof(t9_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( relation_dom(X1) = relation_dom(X2)
& ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) ) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cf8NECqnJN/E---3.1_9162.p',t9_funct_1) ).
fof(c_0_4,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ in(X11,X10)
| X11 = X9
| X10 != singleton(X9) )
& ( X12 != X9
| in(X12,X10)
| X10 != singleton(X9) )
& ( ~ in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) != X13
| X14 = singleton(X13) )
& ( in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) = X13
| X14 = singleton(X13) ) ),
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)],[d1_tarski])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( relation_dom(X2) = relation_dom(X3)
& relation_rng(X2) = singleton(X1)
& relation_rng(X3) = singleton(X1) )
=> X2 = X3 ) ) ),
inference(assume_negation,[status(cth)],[t17_funct_1]) ).
cnf(c_0_6,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( relation(esk15_0)
& function(esk15_0)
& relation(esk16_0)
& function(esk16_0)
& relation_dom(esk15_0) = relation_dom(esk16_0)
& relation_rng(esk15_0) = singleton(esk14_0)
& relation_rng(esk16_0) = singleton(esk14_0)
& esk15_0 != esk16_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( in(esk2_3(X16,X17,X18),relation_dom(X16))
| ~ in(X18,X17)
| X17 != relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( X18 = apply(X16,esk2_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(esk3_2(X16,X22),X22)
| ~ in(X24,relation_dom(X16))
| esk3_2(X16,X22) != apply(X16,X24)
| X22 = relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( in(esk4_2(X16,X22),relation_dom(X16))
| in(esk3_2(X16,X22),X22)
| X22 = relation_rng(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( esk3_2(X16,X22) = apply(X16,esk4_2(X16,X22))
| in(esk3_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_9,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
relation_rng(esk15_0) = singleton(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,negated_conjecture,
relation_rng(esk16_0) = singleton(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X65,X66] :
( ( in(esk17_2(X65,X66),relation_dom(X65))
| relation_dom(X65) != relation_dom(X66)
| X65 = X66
| ~ relation(X66)
| ~ function(X66)
| ~ relation(X65)
| ~ function(X65) )
& ( apply(X65,esk17_2(X65,X66)) != apply(X66,esk17_2(X65,X66))
| relation_dom(X65) != relation_dom(X66)
| X65 = X66
| ~ relation(X66)
| ~ function(X66)
| ~ relation(X65)
| ~ function(X65) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_funct_1])])])])]) ).
cnf(c_0_14,negated_conjecture,
( X1 = esk14_0
| ~ in(X1,relation_rng(esk15_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,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_11])]) ).
cnf(c_0_16,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
relation_rng(esk16_0) = relation_rng(esk15_0),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
relation(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
function(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
relation_dom(esk15_0) = relation_dom(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( in(esk17_2(X1,X2),relation_dom(X1))
| X1 = X2
| relation_dom(X1) != relation_dom(X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( X1 = X2
| apply(X1,esk17_2(X1,X2)) != apply(X2,esk17_2(X1,X2))
| relation_dom(X1) != relation_dom(X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( apply(esk15_0,X1) = esk14_0
| ~ in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( in(apply(esk16_0,X1),relation_rng(esk15_0))
| ~ in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( X1 = esk16_0
| in(esk17_2(X1,esk16_0),relation_dom(X1))
| relation_dom(X1) != relation_dom(esk15_0)
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_21]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
esk15_0 != esk16_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
( esk15_0 = X1
| apply(X1,esk17_2(esk15_0,X1)) != esk14_0
| relation_dom(esk15_0) != relation_dom(X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(esk17_2(esk15_0,X1),relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( apply(esk16_0,X1) = esk14_0
| ~ in(X1,relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
in(esk17_2(esk15_0,esk16_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_16]),c_0_17])]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_19]),c_0_20]),c_0_30])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET995+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.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 16:20:46 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/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.cf8NECqnJN/E---3.1_9162.p
% 0.60/0.55 # Version: 3.1pre001
% 0.60/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.60/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.60/0.55 # Starting sh5l with 300s (1) cores
% 0.60/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9279 completed with status 0
% 0.60/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.60/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.55 # No SInE strategy applied
% 0.60/0.55 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.60/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.55 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.60/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.60/0.55 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.60/0.55 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.60/0.55 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.60/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9288 completed with status 0
% 0.60/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.60/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.55 # No SInE strategy applied
% 0.60/0.55 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.60/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.55 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.60/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.60/0.55 # Preprocessing time : 0.002 s
% 0.60/0.55 # Presaturation interreduction done
% 0.60/0.55
% 0.60/0.55 # Proof found!
% 0.60/0.55 # SZS status Theorem
% 0.60/0.55 # SZS output start CNFRefutation
% See solution above
% 0.60/0.55 # Parsed axioms : 34
% 0.60/0.55 # Removed by relevancy pruning/SinE : 0
% 0.60/0.55 # Initial clauses : 62
% 0.60/0.55 # Removed in clause preprocessing : 0
% 0.60/0.55 # Initial clauses in saturation : 62
% 0.60/0.55 # Processed clauses : 776
% 0.60/0.55 # ...of these trivial : 3
% 0.60/0.55 # ...subsumed : 465
% 0.60/0.55 # ...remaining for further processing : 308
% 0.60/0.55 # Other redundant clauses eliminated : 14
% 0.60/0.55 # Clauses deleted for lack of memory : 0
% 0.60/0.55 # Backward-subsumed : 16
% 0.60/0.55 # Backward-rewritten : 21
% 0.60/0.55 # Generated clauses : 1329
% 0.60/0.55 # ...of the previous two non-redundant : 1229
% 0.60/0.55 # ...aggressively subsumed : 0
% 0.60/0.55 # Contextual simplify-reflections : 17
% 0.60/0.55 # Paramodulations : 1307
% 0.60/0.55 # Factorizations : 4
% 0.60/0.55 # NegExts : 0
% 0.60/0.55 # Equation resolutions : 20
% 0.60/0.55 # Total rewrite steps : 607
% 0.60/0.55 # Propositional unsat checks : 0
% 0.60/0.55 # Propositional check models : 0
% 0.60/0.55 # Propositional check unsatisfiable : 0
% 0.60/0.55 # Propositional clauses : 0
% 0.60/0.55 # Propositional clauses after purity: 0
% 0.60/0.55 # Propositional unsat core size : 0
% 0.60/0.55 # Propositional preprocessing time : 0.000
% 0.60/0.55 # Propositional encoding time : 0.000
% 0.60/0.55 # Propositional solver time : 0.000
% 0.60/0.55 # Success case prop preproc time : 0.000
% 0.60/0.55 # Success case prop encoding time : 0.000
% 0.60/0.55 # Success case prop solver time : 0.000
% 0.60/0.55 # Current number of processed clauses : 207
% 0.60/0.55 # Positive orientable unit clauses : 36
% 0.60/0.55 # Positive unorientable unit clauses: 0
% 0.60/0.55 # Negative unit clauses : 16
% 0.60/0.55 # Non-unit-clauses : 155
% 0.60/0.55 # Current number of unprocessed clauses: 504
% 0.60/0.55 # ...number of literals in the above : 2375
% 0.60/0.55 # Current number of archived formulas : 0
% 0.60/0.55 # Current number of archived clauses : 96
% 0.60/0.55 # Clause-clause subsumption calls (NU) : 7825
% 0.60/0.55 # Rec. Clause-clause subsumption calls : 4045
% 0.60/0.55 # Non-unit clause-clause subsumptions : 287
% 0.60/0.55 # Unit Clause-clause subsumption calls : 473
% 0.60/0.55 # Rewrite failures with RHS unbound : 0
% 0.60/0.55 # BW rewrite match attempts : 9
% 0.60/0.55 # BW rewrite match successes : 5
% 0.60/0.55 # Condensation attempts : 0
% 0.60/0.55 # Condensation successes : 0
% 0.60/0.55 # Termbank termtop insertions : 20110
% 0.60/0.55
% 0.60/0.55 # -------------------------------------------------
% 0.60/0.55 # User time : 0.046 s
% 0.60/0.55 # System time : 0.004 s
% 0.60/0.55 # Total time : 0.050 s
% 0.60/0.55 # Maximum resident set size: 1832 pages
% 0.60/0.55
% 0.60/0.55 # -------------------------------------------------
% 0.60/0.55 # User time : 0.195 s
% 0.60/0.55 # System time : 0.020 s
% 0.60/0.55 # Total time : 0.215 s
% 0.60/0.55 # Maximum resident set size: 1704 pages
% 0.60/0.55 % E---3.1 exiting
% 0.60/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------