TSTP Solution File: SEU217+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU217+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:30:57 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 49 ( 19 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 55 ( 22 ~; 20 |; 8 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t35_funct_1,conjecture,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.1U6T0GC6ev/E---3.1_12034.p',t35_funct_1) ).
fof(t34_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1U6T0GC6ev/E---3.1_12034.p',t34_funct_1) ).
fof(fc2_funct_1,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.1U6T0GC6ev/E---3.1_12034.p',fc2_funct_1) ).
fof(dt_k6_relat_1,axiom,
! [X1] : relation(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.1U6T0GC6ev/E---3.1_12034.p',dt_k6_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[t35_funct_1]) ).
fof(c_0_5,plain,
! [X6,X7,X8] :
( ( relation_dom(X7) = X6
| X7 != identity_relation(X6)
| ~ relation(X7)
| ~ function(X7) )
& ( ~ in(X8,X6)
| apply(X7,X8) = X8
| X7 != identity_relation(X6)
| ~ relation(X7)
| ~ function(X7) )
& ( in(esk3_2(X6,X7),X6)
| relation_dom(X7) != X6
| X7 = identity_relation(X6)
| ~ relation(X7)
| ~ function(X7) )
& ( apply(X7,esk3_2(X6,X7)) != esk3_2(X6,X7)
| relation_dom(X7) != X6
| X7 = identity_relation(X6)
| ~ relation(X7)
| ~ function(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_funct_1])])])])]) ).
fof(c_0_6,plain,
! [X11] :
( relation(identity_relation(X11))
& function(identity_relation(X11)) ),
inference(variable_rename,[status(thm)],[fc2_funct_1]) ).
fof(c_0_7,plain,
! [X10] : relation(identity_relation(X10)),
inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).
fof(c_0_8,negated_conjecture,
( in(esk2_0,esk1_0)
& apply(identity_relation(esk1_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_9,plain,
( apply(X3,X1) = X1
| ~ in(X1,X2)
| X3 != identity_relation(X2)
| ~ relation(X3)
| ~ function(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(identity_relation(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( apply(identity_relation(X1),X2) = X2
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU217+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 09:36:18 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.1U6T0GC6ev/E---3.1_12034.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 12125 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSS-FFSM21-SFFFFFNN
% 0.20/0.49 # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 12133 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSS-FFSM21-SFFFFFNN
% 0.20/0.49 # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 28
% 0.20/0.49 # Removed by relevancy pruning/SinE : 12
% 0.20/0.49 # Initial clauses : 25
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 25
% 0.20/0.49 # Processed clauses : 49
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 48
% 0.20/0.49 # Other redundant clauses eliminated : 4
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 6
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 3
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 4
% 0.20/0.49 # Total rewrite steps : 6
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 20
% 0.20/0.49 # Positive orientable unit clauses : 10
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 5
% 0.20/0.49 # Current number of unprocessed clauses: 6
% 0.20/0.49 # ...number of literals in the above : 18
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 24
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 4
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 3
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1176
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1744 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1684 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------