TSTP Solution File: KRS099+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS099+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:16:12 EDT 2024
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 250 ( 84 equ)
% Maximal formula atoms : 203 ( 20 avg)
% Number of connectives : 346 ( 108 ~; 184 |; 46 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 46 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 37 ( 1 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5,X6,X7] :
( rtt(X4,X5)
& rtt(X4,X6)
& rtt(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 )
& ! [X8] :
( rtt(X4,X8)
=> ca(X8) )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_20_29215),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_2,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5,X6,X7] :
( rtt(X4,X5)
& rtt(X4,X6)
& rtt(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 )
& ! [X8] :
( rtt(X4,X8)
=> ca(X8) )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_3,plain,
! [X33,X37,X38,X39,X40,X41,X42,X43,X44,X45] :
( ( rtt(X33,esk1_1(X33))
| ~ cUnsatisfiable(X33) )
& ( rtt(X33,esk2_1(X33))
| ~ cUnsatisfiable(X33) )
& ( rtt(X33,esk3_1(X33))
| ~ cUnsatisfiable(X33) )
& ( esk1_1(X33) != esk2_1(X33)
| ~ cUnsatisfiable(X33) )
& ( esk1_1(X33) != esk3_1(X33)
| ~ cUnsatisfiable(X33) )
& ( esk2_1(X33) != esk3_1(X33)
| ~ cUnsatisfiable(X33) )
& ( ~ rtt(X33,X37)
| ca(X37)
| ~ cUnsatisfiable(X33) )
& ( ~ rtt(X33,X38)
| ~ rtt(X33,X39)
| X38 = X39
| ~ cUnsatisfiable(X33) )
& ( ~ rtt(X33,X40)
| ~ rtt(X33,X41)
| X40 = X41
| ~ cUnsatisfiable(X33) )
& ( rtt(X42,esk7_1(X42))
| rtt(X42,esk5_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| rtt(X42,esk5_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| rtt(X42,esk5_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk7_1(X42))
| rtt(X42,esk6_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| rtt(X42,esk6_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| rtt(X42,esk6_1(X42))
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk7_1(X42))
| esk5_1(X42) != esk6_1(X42)
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| esk5_1(X42) != esk6_1(X42)
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| esk5_1(X42) != esk6_1(X42)
| rtt(X42,esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk7_1(X42))
| rtt(X42,esk5_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| rtt(X42,esk5_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| rtt(X42,esk5_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk7_1(X42))
| rtt(X42,esk6_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| rtt(X42,esk6_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| rtt(X42,esk6_1(X42))
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk7_1(X42))
| esk5_1(X42) != esk6_1(X42)
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( rtt(X42,esk8_1(X42))
| esk5_1(X42) != esk6_1(X42)
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) )
& ( esk7_1(X42) != esk8_1(X42)
| esk5_1(X42) != esk6_1(X42)
| ~ ca(esk4_1(X42))
| ~ rtt(X42,X43)
| ~ rtt(X42,X44)
| ~ rtt(X42,X45)
| X43 = X44
| X43 = X45
| X44 = X45
| cUnsatisfiable(X42) ) ),
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_2])])])])])])]) ).
cnf(c_0_4,plain,
( X2 = X3
| ~ rtt(X1,X2)
| ~ rtt(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( rtt(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = esk3_1(X2)
| ~ rtt(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( rtt(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_10,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KRS099+1 : TPTP v8.2.0. Released v3.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n017.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sat May 18 22:06:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.55 # Version: 3.1.0
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # new_bool_1 with pid 27688 completed with status 8
% 0.23/0.55 # new_bool_3 with pid 27687 completed with status 8
% 0.23/0.55 # sh5l with pid 27689 completed with status 8
% 0.23/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27686 completed with status 0
% 0.23/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # No SInE strategy applied
% 0.23/0.55 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.23/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.55 # Starting sh5l with 136s (1) cores
% 0.23/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27703 completed with status 0
% 0.23/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # No SInE strategy applied
% 0.23/0.55 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.23/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.55 # Preprocessing time : 0.002 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Unsatisfiable
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 16
% 0.23/0.55 # Removed by relevancy pruning/SinE : 0
% 0.23/0.55 # Initial clauses : 44
% 0.23/0.55 # Removed in clause preprocessing : 11
% 0.23/0.55 # Initial clauses in saturation : 33
% 0.23/0.55 # Processed clauses : 52
% 0.23/0.55 # ...of these trivial : 0
% 0.23/0.55 # ...subsumed : 1
% 0.23/0.55 # ...remaining for further processing : 51
% 0.23/0.55 # Other redundant clauses eliminated : 0
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 12
% 0.23/0.55 # Backward-rewritten : 0
% 0.23/0.55 # Generated clauses : 13
% 0.23/0.55 # ...of the previous two non-redundant : 11
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 19
% 0.23/0.55 # Paramodulations : 12
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 0
% 0.23/0.55 # Disequality decompositions : 0
% 0.23/0.55 # Total rewrite steps : 0
% 0.23/0.55 # ...of those cached : 0
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 6
% 0.23/0.55 # Positive orientable unit clauses : 0
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 2
% 0.23/0.55 # Non-unit-clauses : 4
% 0.23/0.55 # Current number of unprocessed clauses: 24
% 0.23/0.55 # ...number of literals in the above : 179
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 46
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 1048
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 152
% 0.23/0.55 # Non-unit clause-clause subsumptions : 20
% 0.23/0.55 # Unit Clause-clause subsumption calls : 12
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 0
% 0.23/0.55 # BW rewrite match successes : 0
% 0.23/0.55 # Condensation attempts : 0
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 3153
% 0.23/0.55 # Search garbage collected termcells : 598
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.012 s
% 0.23/0.55 # System time : 0.001 s
% 0.23/0.55 # Total time : 0.013 s
% 0.23/0.55 # Maximum resident set size: 1852 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.093 s
% 0.23/0.55 # System time : 0.028 s
% 0.23/0.55 # Total time : 0.121 s
% 0.23/0.55 # Maximum resident set size: 1708 pages
% 0.23/0.55 % E---3.1 exiting
% 0.49/0.55 % E exiting
%------------------------------------------------------------------------------