TSTP Solution File: SEU268+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:35 EDT 2023
% Result : Theorem 11.12s 1.86s
% Output : CNFRefutation 11.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 20 unt; 0 def)
% Number of atoms : 104 ( 26 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 124 ( 52 ~; 55 |; 10 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 51 ( 3 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',t69_enumset1) ).
fof(d1_wellord2,axiom,
! [X1,X2] :
( relation(X2)
=> ( X2 = inclusion_relation(X1)
<=> ( relation_field(X2) = X1
& ! [X3,X4] :
( ( in(X3,X1)
& in(X4,X1) )
=> ( in(ordered_pair(X3,X4),X2)
<=> subset(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',d1_wellord2) ).
fof(l1_wellord1,lemma,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',l1_wellord1) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',dt_k1_wellord2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',reflexivity_r1_tarski) ).
fof(t2_wellord2,conjecture,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p',t2_wellord2) ).
fof(c_0_7,plain,
! [X347,X348] : ordered_pair(X347,X348) = unordered_pair(unordered_pair(X347,X348),singleton(X347)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_8,lemma,
! [X907] : unordered_pair(X907,X907) = singleton(X907),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_9,plain,
! [X168,X169,X170,X171] :
( ( relation_field(X169) = X168
| X169 != inclusion_relation(X168)
| ~ relation(X169) )
& ( ~ in(ordered_pair(X170,X171),X169)
| subset(X170,X171)
| ~ in(X170,X168)
| ~ in(X171,X168)
| X169 != inclusion_relation(X168)
| ~ relation(X169) )
& ( ~ subset(X170,X171)
| in(ordered_pair(X170,X171),X169)
| ~ in(X170,X168)
| ~ in(X171,X168)
| X169 != inclusion_relation(X168)
| ~ relation(X169) )
& ( in(esk29_2(X168,X169),X168)
| relation_field(X169) != X168
| X169 = inclusion_relation(X168)
| ~ relation(X169) )
& ( in(esk30_2(X168,X169),X168)
| relation_field(X169) != X168
| X169 = inclusion_relation(X168)
| ~ relation(X169) )
& ( ~ in(ordered_pair(esk29_2(X168,X169),esk30_2(X168,X169)),X169)
| ~ subset(esk29_2(X168,X169),esk30_2(X168,X169))
| relation_field(X169) != X168
| X169 = inclusion_relation(X168)
| ~ relation(X169) )
& ( in(ordered_pair(esk29_2(X168,X169),esk30_2(X168,X169)),X169)
| subset(esk29_2(X168,X169),esk30_2(X168,X169))
| relation_field(X169) != X168
| X169 = inclusion_relation(X168)
| ~ relation(X169) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_wellord2])])])])]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,lemma,
! [X506,X507] :
( ( ~ reflexive(X506)
| ~ in(X507,relation_field(X506))
| in(ordered_pair(X507,X507),X506)
| ~ relation(X506) )
& ( in(esk89_1(X506),relation_field(X506))
| reflexive(X506)
| ~ relation(X506) )
& ( ~ in(ordered_pair(esk89_1(X506),esk89_1(X506)),X506)
| reflexive(X506)
| ~ relation(X506) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l1_wellord1])])])])]) ).
cnf(c_0_13,plain,
( in(ordered_pair(X1,X2),X3)
| ~ subset(X1,X2)
| ~ in(X1,X4)
| ~ in(X2,X4)
| X3 != inclusion_relation(X4)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X417] : relation(inclusion_relation(X417)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
cnf(c_0_16,lemma,
( reflexive(X1)
| ~ in(ordered_pair(esk89_1(X1),esk89_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X595] : subset(X595,X595),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] : reflexive(inclusion_relation(X1)),
inference(assume_negation,[status(cth)],[t2_wellord2]) ).
cnf(c_0_21,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,lemma,
( reflexive(X1)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk89_1(X1),esk89_1(X1)),unordered_pair(esk89_1(X1),esk89_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_23,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),inclusion_relation(X3))
| ~ subset(X1,X2)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,negated_conjecture,
~ reflexive(inclusion_relation(esk120_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_26,lemma,
( in(esk89_1(X1),relation_field(X1))
| reflexive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_18])]) ).
cnf(c_0_28,lemma,
( reflexive(inclusion_relation(X1))
| ~ in(esk89_1(inclusion_relation(X1)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
~ reflexive(inclusion_relation(esk120_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,lemma,
reflexive(inclusion_relation(X1)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18])]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n009.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:30:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.9NQU2vGut6/E---3.1_23874.p
% 11.12/1.86 # Version: 3.1pre001
% 11.12/1.86 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.12/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.12/1.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.12/1.86 # Starting new_bool_3 with 300s (1) cores
% 11.12/1.86 # Starting new_bool_1 with 300s (1) cores
% 11.12/1.86 # Starting sh5l with 300s (1) cores
% 11.12/1.86 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23952 completed with status 0
% 11.12/1.86 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 11.12/1.86 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.12/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.12/1.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.12/1.86 # No SInE strategy applied
% 11.12/1.86 # Search class: FGHSM-FSLM32-MFFFFFNN
% 11.12/1.86 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 11.12/1.86 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 11.12/1.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 11.12/1.86 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 11.12/1.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 11.12/1.86 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 11.12/1.86 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 23962 completed with status 0
% 11.12/1.86 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 11.12/1.86 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.12/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.12/1.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.12/1.86 # No SInE strategy applied
% 11.12/1.86 # Search class: FGHSM-FSLM32-MFFFFFNN
% 11.12/1.86 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 11.12/1.86 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 11.12/1.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 11.12/1.86 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 11.12/1.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 11.12/1.86 # Preprocessing time : 0.009 s
% 11.12/1.86 # Presaturation interreduction done
% 11.12/1.86
% 11.12/1.86 # Proof found!
% 11.12/1.86 # SZS status Theorem
% 11.12/1.86 # SZS output start CNFRefutation
% See solution above
% 11.12/1.86 # Parsed axioms : 345
% 11.12/1.86 # Removed by relevancy pruning/SinE : 0
% 11.12/1.86 # Initial clauses : 734
% 11.12/1.86 # Removed in clause preprocessing : 33
% 11.12/1.86 # Initial clauses in saturation : 701
% 11.12/1.86 # Processed clauses : 6903
% 11.12/1.86 # ...of these trivial : 68
% 11.12/1.86 # ...subsumed : 3946
% 11.12/1.86 # ...remaining for further processing : 2889
% 11.12/1.86 # Other redundant clauses eliminated : 428
% 11.12/1.86 # Clauses deleted for lack of memory : 0
% 11.12/1.86 # Backward-subsumed : 70
% 11.12/1.86 # Backward-rewritten : 55
% 11.12/1.86 # Generated clauses : 53407
% 11.12/1.86 # ...of the previous two non-redundant : 49429
% 11.12/1.86 # ...aggressively subsumed : 0
% 11.12/1.86 # Contextual simplify-reflections : 65
% 11.12/1.86 # Paramodulations : 52957
% 11.12/1.86 # Factorizations : 32
% 11.12/1.86 # NegExts : 0
% 11.12/1.86 # Equation resolutions : 436
% 11.12/1.86 # Total rewrite steps : 10255
% 11.12/1.86 # Propositional unsat checks : 0
% 11.12/1.86 # Propositional check models : 0
% 11.12/1.86 # Propositional check unsatisfiable : 0
% 11.12/1.86 # Propositional clauses : 0
% 11.12/1.86 # Propositional clauses after purity: 0
% 11.12/1.86 # Propositional unsat core size : 0
% 11.12/1.86 # Propositional preprocessing time : 0.000
% 11.12/1.86 # Propositional encoding time : 0.000
% 11.12/1.86 # Propositional solver time : 0.000
% 11.12/1.86 # Success case prop preproc time : 0.000
% 11.12/1.86 # Success case prop encoding time : 0.000
% 11.12/1.86 # Success case prop solver time : 0.000
% 11.12/1.86 # Current number of processed clauses : 2022
% 11.12/1.86 # Positive orientable unit clauses : 148
% 11.12/1.86 # Positive unorientable unit clauses: 4
% 11.12/1.86 # Negative unit clauses : 308
% 11.12/1.86 # Non-unit-clauses : 1562
% 11.12/1.86 # Current number of unprocessed clauses: 43494
% 11.12/1.86 # ...number of literals in the above : 163927
% 11.12/1.86 # Current number of archived formulas : 0
% 11.12/1.86 # Current number of archived clauses : 764
% 11.12/1.86 # Clause-clause subsumption calls (NU) : 650721
% 11.12/1.86 # Rec. Clause-clause subsumption calls : 340773
% 11.12/1.86 # Non-unit clause-clause subsumptions : 2066
% 11.12/1.86 # Unit Clause-clause subsumption calls : 74962
% 11.12/1.86 # Rewrite failures with RHS unbound : 0
% 11.12/1.86 # BW rewrite match attempts : 147
% 11.12/1.86 # BW rewrite match successes : 93
% 11.12/1.86 # Condensation attempts : 0
% 11.12/1.86 # Condensation successes : 0
% 11.12/1.86 # Termbank termtop insertions : 752036
% 11.12/1.86
% 11.12/1.86 # -------------------------------------------------
% 11.12/1.86 # User time : 1.312 s
% 11.12/1.86 # System time : 0.051 s
% 11.12/1.86 # Total time : 1.363 s
% 11.12/1.86 # Maximum resident set size: 4244 pages
% 11.12/1.86
% 11.12/1.86 # -------------------------------------------------
% 11.12/1.86 # User time : 6.463 s
% 11.12/1.86 # System time : 0.220 s
% 11.12/1.86 # Total time : 6.682 s
% 11.12/1.86 # Maximum resident set size: 2056 pages
% 11.12/1.86 % E---3.1 exiting
% 11.12/1.86 % E---3.1 exiting
%------------------------------------------------------------------------------