TSTP Solution File: KRS069+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS069+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:55 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 93 ( 10 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 105 ( 43 ~; 38 |; 18 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 58 ( 1 sgn 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& ~ cp1(X5) )
& ? [X5] :
( rf3(X4,X5)
& cp2(X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_2) ).
fof(axiom_4,axiom,
! [X4,X5,X6] :
( ( rf2(X4,X5)
& rf2(X4,X6) )
=> X5 = X6 ),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_8) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_7) ).
fof(axiom_3,axiom,
! [X4,X5,X6] :
( ( rf1(X4,X5)
& rf1(X4,X6) )
=> X5 = X6 ),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_3) ).
fof(axiom_6,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/export/starexec/sandbox/tmp/tmp.IPYRlANAhF/E---3.1_11556.p',axiom_6) ).
fof(c_0_6,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& ~ cp1(X5) )
& ? [X5] :
( rf3(X4,X5)
& cp2(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
! [X52,X53,X54] :
( ~ rf2(X52,X53)
| ~ rf2(X52,X54)
| X53 = X54 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_8,plain,
! [X41,X45,X46,X47,X48] :
( ( rf1(X41,esk1_1(X41))
| ~ cUnsatisfiable(X41) )
& ( cp1(esk1_1(X41))
| ~ cUnsatisfiable(X41) )
& ( rf2(X41,esk2_1(X41))
| ~ cUnsatisfiable(X41) )
& ( ~ cp1(esk2_1(X41))
| ~ cUnsatisfiable(X41) )
& ( rf3(X41,esk3_1(X41))
| ~ cUnsatisfiable(X41) )
& ( cp2(esk3_1(X41))
| ~ cUnsatisfiable(X41) )
& ( ~ rf1(X45,X46)
| ~ cp1(X46)
| ~ rf2(X45,X47)
| cp1(X47)
| ~ rf3(X45,X48)
| ~ cp2(X48)
| cUnsatisfiable(X45) ) ),
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)],[c_0_6])])])])])])]) ).
fof(c_0_9,plain,
! [X60,X61] :
( ~ rf3(X60,X61)
| rf2(X60,X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
fof(c_0_10,plain,
! [X58,X59] :
( ~ rf3(X58,X59)
| rf1(X58,X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
cnf(c_0_11,plain,
( X2 = X3
| ~ rf2(X1,X2)
| ~ rf2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( rf2(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( rf3(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X49,X50,X51] :
( ~ rf1(X49,X50)
| ~ rf1(X49,X51)
| X50 = X51 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_16,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( X1 = esk2_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,plain,
( ~ cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( esk2_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = esk3_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_29,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS069+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.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 13:49:34 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.IPYRlANAhF/E---3.1_11556.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11634 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 11647 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 22
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 30
% 0.21/0.50 # Removed in clause preprocessing : 14
% 0.21/0.50 # Initial clauses in saturation : 16
% 0.21/0.50 # Processed clauses : 43
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 1
% 0.21/0.50 # ...remaining for further processing : 42
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 15
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 21
% 0.21/0.50 # ...of the previous two non-redundant : 17
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 1
% 0.21/0.50 # Paramodulations : 20
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 0
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 10
% 0.21/0.50 # Positive orientable unit clauses : 0
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 8
% 0.21/0.50 # Current number of unprocessed clauses: 6
% 0.21/0.50 # ...number of literals in the above : 14
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 33
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 111
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 72
% 0.21/0.50 # Non-unit clause-clause subsumptions : 2
% 0.21/0.50 # Unit Clause-clause subsumption calls : 15
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2211
% 0.21/0.50 # Search garbage collected termcells : 470
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1784 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.025 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.030 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------