TSTP Solution File: KRS067+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS067+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:17:16 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 112 ( 38 ~; 56 |; 14 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 19 ( 1 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ( cc(X1)
& cb(X1) )
| ( cb(X1)
& ca(X1) )
| ( cc(X1)
& ca(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X1] :
( ca(X1)
=> ~ ( cc(X1)
| cb(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_4,plain,
! [X4] :
( ( cc(X4)
| cb(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| cb(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| ca(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| ca(X4)
| cc(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| cb(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| cb(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( cc(X4)
| ca(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ca(X4)
| ca(X4)
| cb(X4)
| ~ cUnsatisfiable(X4) )
& ( ~ cc(X4)
| ~ cb(X4)
| cUnsatisfiable(X4) )
& ( ~ cb(X4)
| ~ ca(X4)
| cUnsatisfiable(X4) )
& ( ~ cc(X4)
| ~ ca(X4)
| cUnsatisfiable(X4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
fof(c_0_5,plain,
! [X5] :
( ( ~ cc(X5)
| ~ ca(X5) )
& ( ~ cb(X5)
| ~ ca(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_6,plain,
( ca(X1)
| ca(X1)
| cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( cc(X1)
| cb(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_9,plain,
( ca(X1)
| ca(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ cb(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( cc(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( cc(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X6] :
( ~ cb(X6)
| ~ cc(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( ~ cc(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( cb(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
( ~ cb(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS067+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.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 : Sat May 18 22:31:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 22193 completed with status 0
% 0.20/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting sh5l with 136s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 22203 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 6
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 19
% 0.20/0.48 # Removed in clause preprocessing : 1
% 0.20/0.48 # Initial clauses in saturation : 18
% 0.20/0.48 # Processed clauses : 31
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 8
% 0.20/0.48 # ...remaining for further processing : 23
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 5
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 8
% 0.20/0.48 # ...of the previous two non-redundant : 3
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 3
% 0.20/0.48 # Paramodulations : 7
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 0
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 7
% 0.20/0.48 # Positive orientable unit clauses : 0
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 5
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 17
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 14
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 14
% 0.20/0.48 # Non-unit clause-clause subsumptions : 14
% 0.20/0.48 # Unit Clause-clause subsumption calls : 2
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 874
% 0.20/0.48 # Search garbage collected termcells : 140
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1688 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.012 s
% 0.20/0.48 # System time : 0.008 s
% 0.20/0.48 # Total time : 0.019 s
% 0.20/0.48 # Maximum resident set size: 1692 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------