TSTP Solution File: KRS006-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS006-1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:15:51 EDT 2024
% Result : Satisfiable 0.22s 0.51s
% Output : Saturation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_27)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
c_0_27,
[final] ).
cnf(c_0_32,plain,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
c_0_28,
[final] ).
cnf(c_0_37,plain,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
c_0_29,
[final] ).
cnf(c_0_38,axiom,
( s1most(X1)
| s(X1,u3r1(X1)) ),
clause_16,
[final] ).
cnf(c_0_39,plain,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
c_0_30,
[final] ).
cnf(c_0_41,plain,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
c_0_33,
[final] ).
cnf(c_0_42,plain,
( s2least(X1)
| ~ c(X1) ),
c_0_34,
[final] ).
cnf(c_0_43,plain,
( c(u4r1(X1))
| ~ e(X1) ),
c_0_35,
[final] ).
cnf(c_0_50,negated_conjecture,
c(u4r1(exist)),
clause_5,
[final] ).
cnf(c_0_51,plain,
( s1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
c_0_36,
[final] ).
cnf(c_0_53,axiom,
( s1most(X1)
| s(X1,u3r2(X1)) ),
clause_17,
[final] ).
cnf(c_0_54,plain,
( ~ s1most(X1)
| ~ s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[final] ).
cnf(c_0_55,plain,
( s2least(u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]),
[final] ).
cnf(c_0_57,plain,
( equalish(X1,X2)
| ~ r1most(X3)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
c_0_44,
[final] ).
cnf(c_0_58,plain,
( r(X1,u4r1(X1))
| ~ e(X1) ),
c_0_45,
[final] ).
cnf(c_0_59,plain,
( r1most(X1)
| ~ e(X1) ),
c_0_46,
[final] ).
cnf(c_0_60,plain,
( r(X1,u4r2(X1))
| ~ e(X1) ),
c_0_47,
[final] ).
cnf(c_0_61,negated_conjecture,
r(exist,u4r1(exist)),
clause_3,
[final] ).
cnf(c_0_62,negated_conjecture,
r1most(exist),
clause_2,
[final] ).
cnf(c_0_63,plain,
( s1most(X1)
| ~ d(X1) ),
c_0_48,
[final] ).
cnf(c_0_64,plain,
( d(u4r2(X1))
| ~ e(X1) ),
c_0_49,
[final] ).
cnf(c_0_68,negated_conjecture,
s2least(u4r1(exist)),
inference(spm,[status(thm)],[c_0_42,c_0_50]),
[final] ).
cnf(c_0_69,negated_conjecture,
d(u4r2(exist)),
clause_4,
[final] ).
cnf(c_0_70,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[final] ).
cnf(c_0_71,plain,
( ~ s1most(u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]),
[final] ).
cnf(c_0_72,plain,
( e(X1)
| ~ r1most(X1)
| ~ r(X1,X2)
| ~ c(X2)
| ~ r(X1,X3)
| ~ d(X3) ),
c_0_56,
[final] ).
cnf(c_0_73,plain,
( equalish(X1,u4r1(X2))
| ~ r(X2,X1)
| ~ e(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_74,plain,
( equalish(X1,u4r2(X2))
| ~ r(X2,X1)
| ~ e(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_60]),c_0_59]),
[final] ).
cnf(c_0_75,negated_conjecture,
( equalish(X1,u4r1(exist))
| ~ r(exist,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_61]),c_0_62])]),
[final] ).
cnf(c_0_76,axiom,
( r1most(X1)
| r(X1,u5r1(X1)) ),
clause_26,
[final] ).
cnf(c_0_77,axiom,
( r1most(X1)
| r(X1,u5r2(X1)) ),
clause_27,
[final] ).
cnf(c_0_78,plain,
( s1most(u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]),
[final] ).
cnf(c_0_79,plain,
( r1most(X1)
| ~ equalish(u5r2(X1),u5r1(X1)) ),
c_0_65,
[final] ).
cnf(c_0_80,plain,
( c(X1)
| ~ s2least(X1) ),
c_0_66,
[final] ).
cnf(c_0_81,plain,
( d(X1)
| ~ s1most(X1) ),
c_0_67,
[final] ).
cnf(c_0_82,negated_conjecture,
~ s1most(u4r1(exist)),
inference(spm,[status(thm)],[c_0_54,c_0_68]),
[final] ).
cnf(c_0_83,negated_conjecture,
s1most(u4r2(exist)),
inference(spm,[status(thm)],[c_0_63,c_0_69]),
[final] ).
cnf(c_0_84,negated_conjecture,
e(exist),
clause_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS006-1 : TPTP v8.2.0. Released v2.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 22:07:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 6975 completed with status 1
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # SAT001_MinMin_p005000_rr_RG with pid 6983 completed with status 1
% 0.22/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.002 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # No proof found!
% 0.22/0.51 # SZS status Satisfiable
% 0.22/0.51 # SZS output start Saturation
% See solution above
% 0.22/0.51 # Parsed axioms : 27
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 27
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 27
% 0.22/0.51 # Processed clauses : 69
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 2
% 0.22/0.51 # ...remaining for further processing : 67
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 2
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 29
% 0.22/0.51 # ...of the previous two non-redundant : 15
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 4
% 0.22/0.51 # Paramodulations : 29
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 3
% 0.22/0.51 # ...of those cached : 1
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 38
% 0.22/0.51 # Positive orientable unit clauses : 7
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 30
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 29
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 285
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 183
% 0.22/0.51 # Non-unit clause-clause subsumptions : 8
% 0.22/0.51 # Unit Clause-clause subsumption calls : 9
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1245
% 0.22/0.51 # Search garbage collected termcells : 63
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.010 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.011 s
% 0.22/0.51 # Maximum resident set size: 1744 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.011 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.015 s
% 0.22/0.51 # Maximum resident set size: 1704 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------