TSTP Solution File: SEU186+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:09 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 53 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 18 |; 5 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn; 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p',t56_relat_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p',d1_relat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p',existence_m1_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p',t6_boole) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t56_relat_1])]) ).
fof(c_0_6,negated_conjecture,
! [X6,X7] :
( relation(esk1_0)
& ~ in(ordered_pair(X6,X7),esk1_0)
& esk1_0 != empty_set ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X11,X12,X15,X17,X18] :
( ( ~ relation(X11)
| ~ in(X12,X11)
| X12 = ordered_pair(esk2_2(X11,X12),esk3_2(X11,X12)) )
& ( in(esk4_1(X15),X15)
| relation(X15) )
& ( esk4_1(X15) != ordered_pair(X17,X18)
| relation(X15) ) ),
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_relat_1])])])])])]) ).
fof(c_0_8,plain,
! [X21,X22] :
( ~ element(X21,X22)
| empty(X22)
| in(X21,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_9,plain,
! [X38] : element(esk9_1(X38),X38),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_10,negated_conjecture,
~ in(ordered_pair(X1,X2),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X2 = ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))
| ~ relation(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
element(esk9_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ relation(X1)
| ~ in(X2,esk1_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( empty(X1)
| in(esk9_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
! [X8] :
( ~ empty(X8)
| X8 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_17,negated_conjecture,
( empty(esk1_0)
| ~ relation(X1)
| ~ in(esk9_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
empty(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n028.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 09:03:36 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4mqERLPsNb/E---3.1_8009.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # sh5l with pid 8090 completed with status 0
% 0.15/0.42 # Result found by sh5l
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGHSS-FFSM21-SFFFFFNN
% 0.15/0.42 # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 8096 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGHSS-FFSM21-SFFFFFNN
% 0.15/0.42 # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 26
% 0.15/0.42 # Removed by relevancy pruning/SinE : 5
% 0.15/0.42 # Initial clauses : 28
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 28
% 0.15/0.42 # Processed clauses : 69
% 0.15/0.42 # ...of these trivial : 1
% 0.15/0.42 # ...subsumed : 5
% 0.15/0.42 # ...remaining for further processing : 63
% 0.15/0.42 # Other redundant clauses eliminated : 1
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 4
% 0.15/0.42 # Generated clauses : 28
% 0.15/0.42 # ...of the previous two non-redundant : 21
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 27
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 1
% 0.15/0.42 # Total rewrite steps : 10
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 32
% 0.15/0.42 # Positive orientable unit clauses : 9
% 0.15/0.42 # Positive unorientable unit clauses: 1
% 0.15/0.42 # Negative unit clauses : 7
% 0.15/0.42 # Non-unit-clauses : 15
% 0.15/0.42 # Current number of unprocessed clauses: 7
% 0.15/0.42 # ...number of literals in the above : 11
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 31
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 22
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 22
% 0.15/0.42 # Non-unit clause-clause subsumptions : 2
% 0.15/0.42 # Unit Clause-clause subsumption calls : 15
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 7
% 0.15/0.42 # BW rewrite match successes : 7
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 1390
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1720 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1688 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------