TSTP Solution File: KRS089+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS089+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:12:58 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 89 ( 30 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 99 ( 39 ~; 32 |; 23 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 45 ( 5 sgn 18 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cowlThing(X4)
=> ? [X8] :
( rp(X4,X8)
& X8 = ispy ) ),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4,X8] :
( rp(X4,X8)
<=> rinvP(X8,X4) ),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_4) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
=> ? [X5,X6,X7] :
( rr(X4,X5)
& rr(X4,X6)
& rr(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 ) ),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_2) ).
fof(axiom_5,axiom,
! [X9,X10,X11] :
( ( rinvP(ispy,X9)
& rinvP(ispy,X10)
& rinvP(ispy,X11) )
=> ( X9 = X10
| X9 = X11
| X10 = X11 ) ),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('/export/starexec/sandbox/tmp/tmp.6uGvXAAc8V/E---3.1_15881.p',axiom_7) ).
fof(c_0_6,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,plain,
! [X46] :
( ( rp(X46,esk4_1(X46))
| ~ cowlThing(X46) )
& ( esk4_1(X46) = ispy
| ~ cowlThing(X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).
fof(c_0_8,plain,
! [X40] :
( cowlThing(X40)
& ~ cowlNothing(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,plain,
( esk4_1(X1) = ispy
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X48,X49] :
( ( ~ rp(X48,X49)
| rinvP(X49,X48) )
& ( ~ rinvP(X49,X48)
| rp(X48,X49) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
cnf(c_0_12,plain,
( rp(X1,esk4_1(X1))
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
esk4_1(X1) = ispy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
fof(c_0_14,plain,
! [X4] :
( cUnsatisfiable(X4)
=> ? [X5,X6,X7] :
( rr(X4,X5)
& rr(X4,X6)
& rr(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_15,plain,
! [X50,X51,X52] :
( ~ rinvP(ispy,X50)
| ~ rinvP(ispy,X51)
| ~ rinvP(ispy,X52)
| X50 = X51
| X50 = X52
| X51 = X52 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_16,plain,
( rinvP(X2,X1)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
rp(X1,ispy),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10])]),c_0_13]) ).
fof(c_0_18,plain,
! [X42] :
( ( rr(X42,esk1_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rr(X42,esk2_1(X42))
| ~ cUnsatisfiable(X42) )
& ( rr(X42,esk3_1(X42))
| ~ cUnsatisfiable(X42) )
& ( esk1_1(X42) != esk2_1(X42)
| ~ cUnsatisfiable(X42) )
& ( esk1_1(X42) != esk3_1(X42)
| ~ cUnsatisfiable(X42) )
& ( esk2_1(X42) != esk3_1(X42)
| ~ cUnsatisfiable(X42) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
cnf(c_0_19,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| ~ rinvP(ispy,X1)
| ~ rinvP(ispy,X2)
| ~ rinvP(ispy,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
rinvP(ispy,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( esk1_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( X1 = X2
| X3 = X2
| X3 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20])]) ).
cnf(c_0_23,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( esk1_1(X1) = X2
| esk3_1(X1) = X2
| ~ cUnsatisfiable(X1) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,plain,
( esk1_1(X1) != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
cUnsatisfiable(i2003_11_14_17_19_53168),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_27,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[c_0_26,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS089+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:52:49 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.6uGvXAAc8V/E---3.1_15881.p
% 0.20/0.49 # Version: 3.1.0
% 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15958 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 15971 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 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 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (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 Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 19
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 28
% 0.20/0.49 # Removed in clause preprocessing : 14
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 31
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 31
% 0.20/0.49 # Other redundant clauses eliminated : 19
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 7
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 114
% 0.20/0.49 # ...of the previous two non-redundant : 66
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 68
% 0.20/0.49 # Factorizations : 26
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 19
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 4
% 0.20/0.49 # ...of those cached : 0
% 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 : 9
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 5
% 0.20/0.49 # Current number of unprocessed clauses: 63
% 0.20/0.49 # ...number of literals in the above : 216
% 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) : 30
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 20
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 8
% 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 : 1935
% 0.20/0.49 # Search garbage collected termcells : 361
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.021 s
% 0.20/0.49 # System time : 0.006 s
% 0.20/0.49 # Total time : 0.027 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------