TSTP Solution File: KRS063+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS063+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:00 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 11 |; 7 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 21 ( 3 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cEuroMP(X4)
<=> ? [X5] :
( risEuroMPFrom(X4,X5)
& cowlThing(X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p',axiom_3) ).
fof(axiom_5,axiom,
! [X4,X5] :
( risEuroMPFrom(X4,X5)
<=> rhasEuroMP(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p',axiom_5) ).
fof(axiom_10,axiom,
~ cEuroMP(iKinnock),
file('/export/starexec/sandbox2/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p',axiom_10) ).
fof(axiom_14,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox2/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p',axiom_14) ).
fof(c_0_5,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_6,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_7,plain,
! [X34] :
( cowlThing(X34)
& ~ cowlNothing(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
cnf(c_0_8,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2)
| ~ cowlThing(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,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])])]) ).
fof(c_0_11,plain,
~ cEuroMP(iKinnock),
inference(fof_simplification,[status(thm)],[axiom_10]) ).
cnf(c_0_12,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_13,plain,
( risEuroMPFrom(X2,X1)
| ~ rhasEuroMP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
~ cEuroMP(iKinnock),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( cEuroMP(X1)
| ~ rhasEuroMP(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[axiom_14]) ).
cnf(c_0_17,plain,
~ cEuroMP(iKinnock),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS063+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:43:20 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/tmp/tmp.2tXrp2gkbC/E---3.1_6343.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6485 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.52 # Starting sh5l with 136s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 6498 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSF-FFSM11-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 27
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 38
% 0.21/0.52 # Removed in clause preprocessing : 14
% 0.21/0.52 # Initial clauses in saturation : 24
% 0.21/0.52 # Processed clauses : 55
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 55
% 0.21/0.52 # Other redundant clauses eliminated : 6
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 13
% 0.21/0.52 # ...of the previous two non-redundant : 8
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 7
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 6
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 1
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 25
% 0.21/0.52 # Positive orientable unit clauses : 14
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 9
% 0.21/0.52 # Current number of unprocessed clauses: 1
% 0.21/0.52 # ...number of literals in the above : 2
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 25
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 29
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 24
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 1
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 1843
% 0.21/0.52 # Search garbage collected termcells : 398
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1780 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.016 s
% 0.21/0.52 # System time : 0.011 s
% 0.21/0.52 # Total time : 0.027 s
% 0.21/0.52 # Maximum resident set size: 1712 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------