TSTP Solution File: KRS078+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS078+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:18 EDT 2024
% Result : Unsatisfiable 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 124 ( 8 equ)
% Maximal formula atoms : 65 ( 6 avg)
% Number of connectives : 163 ( 59 ~; 70 |; 27 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 44 ( 1 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X4,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_19_13721),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_3,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X4,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_4,plain,
! [X58,X59] :
( ( ~ rinvR(X58,X59)
| rr(X59,X58) )
& ( ~ rr(X59,X58)
| rinvR(X58,X59) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
fof(c_0_5,plain,
! [X44,X47,X48,X49,X51,X52,X53,X57] :
( ( rr(X44,esk1_1(X44))
| ~ cUnsatisfiable(X44) )
& ( rinvR(esk1_1(X44),esk2_1(X44))
| ~ cUnsatisfiable(X44) )
& ( ~ rs(esk2_1(X44),X47)
| cp(X47)
| ~ cUnsatisfiable(X44) )
& ( ~ rinvR(esk1_1(X44),X48)
| ~ rinvR(esk1_1(X44),X49)
| X48 = X49
| ~ cUnsatisfiable(X44) )
& ( rs(X44,esk3_1(X44))
| ~ cUnsatisfiable(X44) )
& ( ~ cq(esk3_1(X44))
| ~ cUnsatisfiable(X44) )
& ( ~ cp(esk3_1(X44))
| ~ cUnsatisfiable(X44) )
& ( rinvR(X52,esk5_2(X51,X52))
| rs(X53,esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) )
& ( rinvR(X52,esk6_2(X51,X52))
| rs(X53,esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) )
& ( esk5_2(X51,X52) != esk6_2(X51,X52)
| rs(X53,esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) )
& ( rinvR(X52,esk5_2(X51,X52))
| ~ cp(esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) )
& ( rinvR(X52,esk6_2(X51,X52))
| ~ cp(esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) )
& ( esk5_2(X51,X52) != esk6_2(X51,X52)
| ~ cp(esk4_3(X51,X52,X53))
| ~ rinvR(X52,X53)
| ~ rr(X51,X52)
| ~ rs(X51,X57)
| cq(X57)
| cp(X57)
| cUnsatisfiable(X51) ) ),
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_3])])])])])])]) ).
cnf(c_0_6,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X2 = X3
| ~ rinvR(esk1_1(X1),X2)
| ~ rinvR(esk1_1(X1),X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rinvR(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ rinvR(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( rinvR(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( cp(X2)
| ~ rs(esk2_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( cp(X1)
| ~ rs(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( rs(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_18,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KRS078+1 : TPTP v8.2.0. Released v3.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.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 : Sat May 18 22:18:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26163 completed with status 0
% 0.22/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.50 # Starting new_bool_3 with 162s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 158s (1) cores
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26180 completed with status 0
% 0.22/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Unsatisfiable
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 18
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 33
% 0.22/0.50 # Removed in clause preprocessing : 14
% 0.22/0.50 # Initial clauses in saturation : 19
% 0.22/0.50 # Processed clauses : 40
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 40
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 11
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 12
% 0.22/0.50 # ...of the previous two non-redundant : 8
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 2
% 0.22/0.50 # Paramodulations : 11
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 0
% 0.22/0.50 # ...of those cached : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 9
% 0.22/0.50 # Positive orientable unit clauses : 0
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 2
% 0.22/0.50 # Non-unit-clauses : 7
% 0.22/0.50 # Current number of unprocessed clauses: 6
% 0.22/0.50 # ...number of literals in the above : 32
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 32
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 432
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 138
% 0.22/0.50 # Non-unit clause-clause subsumptions : 2
% 0.22/0.50 # Unit Clause-clause subsumption calls : 11
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 0
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 2552
% 0.22/0.50 # Search garbage collected termcells : 575
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.009 s
% 0.22/0.50 # System time : 0.001 s
% 0.22/0.50 # Total time : 0.010 s
% 0.22/0.50 # Maximum resident set size: 1808 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.023 s
% 0.22/0.50 # System time : 0.009 s
% 0.22/0.50 # Total time : 0.031 s
% 0.22/0.50 # Maximum resident set size: 1716 pages
% 0.22/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------