TSTP Solution File: KRS017-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS017-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:11:52 EDT 2024
% Result : Unsatisfiable 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 6 unt; 0 nHn; 14 RR)
% Number of literals : 29 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,axiom,
( a(X1)
| ~ e(X2)
| ~ r(X2,X3)
| ~ r(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZZBV7VkBe2/E---3.1_2749.p',clause_4) ).
cnf(clause_3,axiom,
( r(X1,u0r3(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZZBV7VkBe2/E---3.1_2749.p',clause_3) ).
cnf(clause_2,negated_conjecture,
~ a(exists),
file('/export/starexec/sandbox2/tmp/tmp.ZZBV7VkBe2/E---3.1_2749.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exists),
file('/export/starexec/sandbox2/tmp/tmp.ZZBV7VkBe2/E---3.1_2749.p',clause_1) ).
cnf(c_0_4,plain,
( a(X1)
| ~ e(X2)
| ~ r(X2,X3)
| ~ r(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_5,plain,
( r(X1,u0r3(X1))
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_6,plain,
( a(X1)
| ~ e(X2)
| ~ r(X2,X3)
| ~ r(X1,X3) ),
c_0_4 ).
cnf(c_0_7,plain,
( r(X1,u0r3(X1))
| ~ e(X1) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
~ a(exists),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_9,plain,
( a(X1)
| ~ r(X1,u0r3(X2))
| ~ e(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ a(exists),
c_0_8 ).
cnf(c_0_11,plain,
( a(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
e(exists),
clause_1 ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS017-1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:11:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/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/tmp/tmp.ZZBV7VkBe2/E---3.1_2749.p
% 0.22/0.48 # Version: 3.1.0
% 0.22/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 # Starting sh5l with 300s (1) cores
% 0.22/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2827 completed with status 0
% 0.22/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.22/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.48 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.22/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.48 # Starting sh5l with 136s (1) cores
% 0.22/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2833 completed with status 0
% 0.22/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.22/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.48 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.22/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.48 # Preprocessing time : 0.001 s
% 0.22/0.48
% 0.22/0.48 # Proof found!
% 0.22/0.48 # SZS status Unsatisfiable
% 0.22/0.48 # SZS output start CNFRefutation
% See solution above
% 0.22/0.48 # Parsed axioms : 7
% 0.22/0.48 # Removed by relevancy pruning/SinE : 0
% 0.22/0.48 # Initial clauses : 7
% 0.22/0.48 # Removed in clause preprocessing : 0
% 0.22/0.48 # Initial clauses in saturation : 7
% 0.22/0.48 # Processed clauses : 9
% 0.22/0.48 # ...of these trivial : 0
% 0.22/0.48 # ...subsumed : 0
% 0.22/0.48 # ...remaining for further processing : 9
% 0.22/0.48 # Other redundant clauses eliminated : 0
% 0.22/0.48 # Clauses deleted for lack of memory : 0
% 0.22/0.48 # Backward-subsumed : 0
% 0.22/0.48 # Backward-rewritten : 0
% 0.22/0.48 # Generated clauses : 6
% 0.22/0.48 # ...of the previous two non-redundant : 3
% 0.22/0.48 # ...aggressively subsumed : 0
% 0.22/0.48 # Contextual simplify-reflections : 0
% 0.22/0.48 # Paramodulations : 6
% 0.22/0.48 # Factorizations : 0
% 0.22/0.48 # NegExts : 0
% 0.22/0.48 # Equation resolutions : 0
% 0.22/0.48 # Disequality decompositions : 0
% 0.22/0.48 # Total rewrite steps : 1
% 0.22/0.48 # ...of those cached : 0
% 0.22/0.48 # Propositional unsat checks : 0
% 0.22/0.48 # Propositional check models : 0
% 0.22/0.48 # Propositional check unsatisfiable : 0
% 0.22/0.48 # Propositional clauses : 0
% 0.22/0.48 # Propositional clauses after purity: 0
% 0.22/0.48 # Propositional unsat core size : 0
% 0.22/0.48 # Propositional preprocessing time : 0.000
% 0.22/0.48 # Propositional encoding time : 0.000
% 0.22/0.48 # Propositional solver time : 0.000
% 0.22/0.48 # Success case prop preproc time : 0.000
% 0.22/0.48 # Success case prop encoding time : 0.000
% 0.22/0.48 # Success case prop solver time : 0.000
% 0.22/0.48 # Current number of processed clauses : 9
% 0.22/0.48 # Positive orientable unit clauses : 1
% 0.22/0.48 # Positive unorientable unit clauses: 0
% 0.22/0.48 # Negative unit clauses : 1
% 0.22/0.48 # Non-unit-clauses : 7
% 0.22/0.48 # Current number of unprocessed clauses: 0
% 0.22/0.48 # ...number of literals in the above : 0
% 0.22/0.48 # Current number of archived formulas : 0
% 0.22/0.48 # Current number of archived clauses : 0
% 0.22/0.48 # Clause-clause subsumption calls (NU) : 5
% 0.22/0.48 # Rec. Clause-clause subsumption calls : 4
% 0.22/0.48 # Non-unit clause-clause subsumptions : 0
% 0.22/0.48 # Unit Clause-clause subsumption calls : 0
% 0.22/0.48 # Rewrite failures with RHS unbound : 0
% 0.22/0.48 # BW rewrite match attempts : 0
% 0.22/0.48 # BW rewrite match successes : 0
% 0.22/0.48 # Condensation attempts : 0
% 0.22/0.48 # Condensation successes : 0
% 0.22/0.48 # Termbank termtop insertions : 264
% 0.22/0.48 # Search garbage collected termcells : 21
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.003 s
% 0.22/0.48 # System time : 0.001 s
% 0.22/0.48 # Total time : 0.003 s
% 0.22/0.48 # Maximum resident set size: 1624 pages
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.005 s
% 0.22/0.48 # System time : 0.007 s
% 0.22/0.48 # Total time : 0.012 s
% 0.22/0.48 # Maximum resident set size: 1692 pages
% 0.22/0.48 % E---3.1 exiting
% 0.22/0.49 % E exiting
%------------------------------------------------------------------------------