TSTP Solution File: KRS029+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS029+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:11:53 EDT 2024
% Result : Satisfiable 0.21s 0.50s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_10)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_11,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_12,plain,
( rinvR(X1,esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_13,plain,
( X2 = X3
| ~ rr(esk1_1(X1),X2)
| ~ rr(esk1_1(X1),X3)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_14,plain,
( rr(esk1_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[final] ).
cnf(c_0_15,plain,
( X1 = X2
| ~ rr(esk1_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]),
[final] ).
cnf(c_0_16,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_17,plain,
( cp1(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_18,plain,
( esk2_1(X1) = X1
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_19,plain,
( rr(X1,esk4_2(X2,X1))
| cSatisfiable(X2)
| ~ rinvR(X2,X1)
| ~ rr(X1,X3)
| ~ cp1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_20,plain,
( cp1(X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[final] ).
cnf(c_0_21,plain,
( rr(X1,esk3_2(X2,X1))
| cSatisfiable(X2)
| ~ rinvR(X2,X1)
| ~ rr(X1,X3)
| ~ cp1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_22,plain,
( cSatisfiable(X1)
| esk3_2(X1,X2) != esk4_2(X1,X2)
| ~ rinvR(X1,X2)
| ~ rr(X2,X3)
| ~ cp1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_28,plain,
( cSatisfiable(X1)
| ~ rinvR(X1,esk1_1(X2))
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[final] ).
cnf(c_0_29,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_33,plain,
( cSatisfiable(X1)
| ~ rr(esk1_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[final] ).
cnf(c_0_40,plain,
( cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]),
[final] ).
cnf(c_0_41,plain,
( X1 = esk2_1(X2)
| ~ rr(esk1_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]),
[final] ).
cnf(c_0_42,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_43,plain,
( ~ cp4(X1)
| ~ cp5(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_44,plain,
( ~ cp5(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_45,plain,
( ~ cp4(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_46,plain,
( ~ cp5(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_47,plain,
( ~ cp4(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_48,plain,
( ~ cp3(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_49,plain,
( ~ cp5(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_50,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_51,plain,
( ~ cp4(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_52,plain,
( ~ cp3(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_53,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_54,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_55,plain,
cSatisfiable(i2003_11_14_17_15_22537),
inference(split_conjunct,[status(thm)],[axiom_8]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS029+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:45:27 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.8bRvnCIIPK/E---3.1_17061.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 17139 completed with status 1
% 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-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG 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 # SAT001_MinMin_p005000_rr_RG with pid 17154 completed with status 1
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 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-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG 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 # No proof found!
% 0.21/0.50 # SZS status Satisfiable
% 0.21/0.50 # SZS output start Saturation
% See solution above
% 0.21/0.50 # Parsed axioms : 23
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 38
% 0.21/0.50 # Removed in clause preprocessing : 15
% 0.21/0.50 # Initial clauses in saturation : 23
% 0.21/0.50 # Processed clauses : 72
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 11
% 0.21/0.50 # ...remaining for further processing : 61
% 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 : 7
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 41
% 0.21/0.50 # ...of the previous two non-redundant : 36
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 4
% 0.21/0.50 # Paramodulations : 41
% 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 : 31
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 29
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 31
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 396
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 205
% 0.21/0.50 # Non-unit clause-clause subsumptions : 22
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 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 : 3081
% 0.21/0.50 # Search garbage collected termcells : 553
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.009 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1792 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.028 s
% 0.21/0.50 # System time : 0.007 s
% 0.21/0.50 # Total time : 0.036 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------