TSTP Solution File: KRS012-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS012-1 : TPTP v8.1.2. Released v2.0.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 : Sat May 4 08:12:44 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 6 unt; 2 nHn; 17 RR)
% Number of literals : 42 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_3,axiom,
( e(X1)
| ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_3) ).
cnf(clause_4,axiom,
( d(X1)
| ~ c(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_4) ).
cnf(clause_12,axiom,
( f(X1)
| ~ e(u1r1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_12) ).
cnf(clause_2,negated_conjecture,
~ f(exists),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_2) ).
cnf(clause_13,axiom,
( f(X1)
| r(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_13) ).
cnf(clause_1,negated_conjecture,
c(exists),
file('/export/starexec/sandbox/tmp/tmp.8uVXoAKjF2/E---3.1_7740.p',clause_1) ).
cnf(c_0_6,plain,
( e(X1)
| ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_7,plain,
( d(X1)
| ~ c(X2)
| ~ r(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_8,plain,
( e(X1)
| ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1) ),
c_0_6 ).
cnf(c_0_9,plain,
( d(X1)
| ~ c(X2)
| ~ r(X2,X1) ),
c_0_7 ).
cnf(c_0_10,plain,
( f(X1)
| ~ e(u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_11,negated_conjecture,
~ f(exists),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_12,plain,
( e(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
( f(X1)
| r(X1,u1r1(X1)) ),
clause_13 ).
cnf(c_0_14,plain,
( f(X1)
| ~ e(u1r1(X1)) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
~ f(exists),
c_0_11 ).
cnf(c_0_16,plain,
( f(X1)
| ~ c(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
c(exists),
clause_1 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS012-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 14:01:51 EDT 2024
% 0.13/0.35 % 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.8uVXoAKjF2/E---3.1_7740.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 7820 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: FGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_CO_MinMin_p005000_rr 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 # SAT001_CO_MinMin_p005000_rr with pid 7825 completed with status 0
% 0.20/0.49 # Result found by SAT001_CO_MinMin_p005000_rr
% 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: FGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_CO_MinMin_p005000_rr 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 : 13
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 13
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 13
% 0.20/0.49 # Processed clauses : 26
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 26
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 3
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 7
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 1
% 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 : 12
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 10
% 0.20/0.49 # Current number of unprocessed clauses: 3
% 0.20/0.49 # ...number of literals in the above : 10
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 14
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 3
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 3
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 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 : 26
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 570
% 0.20/0.49 # Search garbage collected termcells : 28
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.001 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1656 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.010 s
% 0.20/0.49 # Total time : 0.019 s
% 0.20/0.49 # Maximum resident set size: 1696 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------