TSTP Solution File: KRS129+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS129+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Mon May 20 23:16:19 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 108 ( 48 ~; 39 |; 15 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 31 ( 4 sgn 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(the_axiom,conjecture,
( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& cEuroMP(iKinnock) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_3,axiom,
! [X4] :
( cEuroMP(X4)
<=> ? [X5] :
( risEuroMPFrom(X4,X5)
& cowlThing(X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_5,axiom,
! [X4,X5] :
( risEuroMPFrom(X4,X5)
<=> rhasEuroMP(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_13,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13) ).
fof(c_0_6,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,negated_conjecture,
~ ( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& cEuroMP(iKinnock) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_8,plain,
! [X37,X39,X40] :
( ( risEuroMPFrom(X37,esk1_1(X37))
| ~ cEuroMP(X37) )
& ( cowlThing(esk1_1(X37))
| ~ cEuroMP(X37) )
& ( ~ risEuroMPFrom(X39,X40)
| ~ cowlThing(X40)
| cEuroMP(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[axiom_3])])])])])])]) ).
fof(c_0_9,plain,
! [X34] :
( cowlThing(X34)
& ~ cowlNothing(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_10,negated_conjecture,
( ( ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk2_0)
| cowlNothing(esk2_0)
| ~ cEuroMP(iKinnock) )
& ( xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk2_0)
| cowlNothing(esk2_0)
| ~ cEuroMP(iKinnock) ) ),
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_7])])])])]) ).
fof(c_0_11,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_12,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2)
| ~ cowlThing(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X43,X44] :
( ( ~ risEuroMPFrom(X43,X44)
| rhasEuroMP(X44,X43) )
& ( ~ rhasEuroMP(X44,X43)
| risEuroMPFrom(X43,X44) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_15,negated_conjecture,
( xsd_integer(esk3_0)
| cowlNothing(esk2_0)
| ~ xsd_string(esk3_0)
| ~ cowlThing(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X35] :
( ( ~ xsd_string(X35)
| ~ xsd_integer(X35) )
& ( xsd_integer(X35)
| xsd_string(X35) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
( risEuroMPFrom(X2,X1)
| ~ rhasEuroMP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( xsd_string(esk3_0)
| cowlNothing(esk2_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13])]) ).
cnf(c_0_21,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( cEuroMP(X1)
| ~ rhasEuroMP(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
cnf(c_0_25,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_13])]) ).
cnf(c_0_26,negated_conjecture,
( ~ xsd_string(esk3_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_25,c_0_21]),c_0_22]) ).
cnf(c_0_29,negated_conjecture,
~ xsd_string(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
~ xsd_integer(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS129+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 22:23:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20547 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # Starting sh5l with 136s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 20551 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 27
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 39
% 0.19/0.49 # Removed in clause preprocessing : 14
% 0.19/0.49 # Initial clauses in saturation : 25
% 0.19/0.49 # Processed clauses : 60
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 60
% 0.19/0.49 # Other redundant clauses eliminated : 6
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 14
% 0.19/0.49 # ...of the previous two non-redundant : 11
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 2
% 0.19/0.49 # Paramodulations : 8
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 6
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 3
% 0.19/0.49 # ...of those cached : 1
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 27
% 0.19/0.49 # Positive orientable unit clauses : 15
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 3
% 0.19/0.49 # Non-unit-clauses : 9
% 0.19/0.49 # Current number of unprocessed clauses: 1
% 0.19/0.49 # ...number of literals in the above : 2
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 28
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 37
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 29
% 0.19/0.49 # Non-unit clause-clause subsumptions : 2
% 0.19/0.49 # Unit Clause-clause subsumption calls : 27
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2058
% 0.19/0.49 # Search garbage collected termcells : 467
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.007 s
% 0.19/0.49 # Maximum resident set size: 1796 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.020 s
% 0.19/0.49 # System time : 0.007 s
% 0.19/0.49 # Total time : 0.027 s
% 0.19/0.49 # Maximum resident set size: 1716 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------