TSTP Solution File: KRS072+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 88 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 116 ( 50 ~; 46 |; 16 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.xKSWOSHJHL/E---3.1_31520.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rinvR(X4,X5)
& ! [X6,X7] :
( ( rr(X5,X6)
& rr(X5,X7) )
=> X6 = X7 )
& ? [X8] :
( rr(X5,X8)
& cp1(X8) ) )
& cp2(X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.xKSWOSHJHL/E---3.1_31520.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp3(X4)
| cp2(X4)
| cp4(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.xKSWOSHJHL/E---3.1_31520.p',axiom_3) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox/tmp/tmp.xKSWOSHJHL/E---3.1_31520.p',axiom_8) ).
fof(c_0_4,plain,
! [X57,X58] :
( ( ~ rinvR(X57,X58)
| rr(X58,X57) )
& ( ~ rr(X58,X57)
| rinvR(X57,X58) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_5,plain,
! [X43,X45,X46,X48,X49,X52] :
( ( rinvR(X43,esk1_1(X43))
| ~ cUnsatisfiable(X43) )
& ( ~ rr(esk1_1(X43),X45)
| ~ rr(esk1_1(X43),X46)
| X45 = X46
| ~ cUnsatisfiable(X43) )
& ( rr(esk1_1(X43),esk2_1(X43))
| ~ cUnsatisfiable(X43) )
& ( cp1(esk2_1(X43))
| ~ cUnsatisfiable(X43) )
& ( cp2(X43)
| ~ cUnsatisfiable(X43) )
& ( rr(X49,esk3_2(X48,X49))
| ~ rinvR(X48,X49)
| ~ rr(X49,X52)
| ~ cp1(X52)
| ~ cp2(X48)
| cUnsatisfiable(X48) )
& ( rr(X49,esk4_2(X48,X49))
| ~ rinvR(X48,X49)
| ~ rr(X49,X52)
| ~ cp1(X52)
| ~ cp2(X48)
| cUnsatisfiable(X48) )
& ( esk3_2(X48,X49) != esk4_2(X48,X49)
| ~ rinvR(X48,X49)
| ~ rr(X49,X52)
| ~ cp1(X52)
| ~ cp2(X48)
| cUnsatisfiable(X48) ) ),
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)],[axiom_2])])])])])])]) ).
fof(c_0_6,plain,
! [X53] :
( ( ~ cp3(X53)
| ~ cp1(X53) )
& ( ~ cp2(X53)
| ~ cp1(X53) )
& ( ~ cp4(X53)
| ~ cp1(X53) )
& ( ~ cp5(X53)
| ~ cp1(X53) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_7,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( X2 = X3
| ~ rr(esk1_1(X1),X2)
| ~ rr(esk1_1(X1),X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ rr(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
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 : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n019.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 13:49:44 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/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.xKSWOSHJHL/E---3.1_31520.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31608 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 31623 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 23
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 39
% 0.21/0.51 # Removed in clause preprocessing : 15
% 0.21/0.51 # Initial clauses in saturation : 24
% 0.21/0.51 # Processed clauses : 52
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 52
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 10
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 15
% 0.21/0.51 # ...of the previous two non-redundant : 12
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 14
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 0
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 17
% 0.21/0.51 # Positive orientable unit clauses : 0
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 15
% 0.21/0.51 # Current number of unprocessed clauses: 8
% 0.21/0.51 # ...number of literals in the above : 33
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 36
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 178
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 120
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 10
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2577
% 0.21/0.51 # Search garbage collected termcells : 587
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1796 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.035 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.043 s
% 0.21/0.51 # Maximum resident set size: 1720 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------