TSTP Solution File: KRS035+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS035+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:54 EDT 2024
% Result : Satisfiable 0.18s 0.48s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_11)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_14,plain,
( rf(X2,X1)
| ~ rinvF(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_15,plain,
( rinvF(esk1_1(X1),esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_17,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]),
[final] ).
cnf(c_0_18,plain,
( rinvR(X1,esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_20,plain,
( rr(X1,X2)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_21,plain,
( rf(esk2_1(X1),esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[final] ).
cnf(c_0_22,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]),
[final] ).
cnf(c_0_23,plain,
( rr(esk1_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[final] ).
cnf(c_0_24,plain,
( rinvF(X1,esk3_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_27,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]),
[final] ).
cnf(c_0_28,plain,
( rr(esk2_1(X1),esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_29,plain,
( rr(X1,X2)
| ~ rr(X1,esk1_1(X2))
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
cnf(c_0_30,plain,
( rf(esk3_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]),
[final] ).
cnf(c_0_34,plain,
( ca(X1)
| cSatisfiable(X1)
| ~ rinvR(X1,X2)
| ~ rinvF(X2,X3)
| ~ ca(X3)
| ~ rinvF(X1,X4)
| ~ ca(X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_35,plain,
( rinvR(esk1_1(X1),esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_36,plain,
( rr(esk2_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]),
[final] ).
cnf(c_0_37,plain,
( rr(esk3_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_30]),
[final] ).
cnf(c_0_38,plain,
( X2 = X3
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[final] ).
cnf(c_0_39,plain,
( ~ ca(X1)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_40,plain,
( ca(esk3_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_41,plain,
( ca(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_43,plain,
( ca(esk1_1(X1))
| cSatisfiable(esk1_1(X1))
| ~ rinvF(esk2_1(X1),X2)
| ~ rinvF(esk1_1(X1),X3)
| ~ ca(X3)
| ~ ca(X2)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_44,plain,
( rr(esk2_1(esk1_1(X1)),X1)
| ~ cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]),
[final] ).
cnf(c_0_45,plain,
( rr(X1,esk1_1(X2))
| ~ rr(X1,esk2_1(X2))
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]),
[final] ).
cnf(c_0_46,plain,
( rr(X1,X2)
| ~ rr(X1,esk2_1(X2))
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]),
[final] ).
cnf(c_0_47,plain,
( rinvR(X1,esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]),
[final] ).
cnf(c_0_48,plain,
( rr(esk1_1(esk1_1(X1)),X1)
| ~ cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]),
[final] ).
cnf(c_0_49,plain,
( rr(esk3_1(esk1_1(X1)),X1)
| ~ cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]),
[final] ).
cnf(c_0_50,plain,
( X1 = esk1_1(X2)
| ~ rf(esk2_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_21]),
[final] ).
cnf(c_0_51,plain,
( rr(X1,X2)
| ~ rr(X1,esk3_1(X2))
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_37]),
[final] ).
cnf(c_0_52,plain,
( rinvR(X1,esk3_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]),
[final] ).
cnf(c_0_53,plain,
( X1 = X2
| ~ rf(esk3_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_30]),
[final] ).
cnf(c_0_54,plain,
( rinvF(X2,X1)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_55,plain,
( ~ cSatisfiable(esk3_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_56,plain,
( ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_41]),
[final] ).
cnf(c_0_57,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_58,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_59,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_60,plain,
cSatisfiable(i2003_11_14_17_15_44810),
inference(split_conjunct,[status(thm)],[axiom_7]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS035+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n022.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Fri May 3 13:35:27 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.FyLrmq0CaA/E---3.1_29772.p
% 0.18/0.48 # Version: 3.1.0
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29900 completed with status 1
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.48 # Starting sh5l with 136s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 29916 completed with status 1
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # No proof found!
% 0.18/0.48 # SZS status Satisfiable
% 0.18/0.48 # SZS output start Saturation
% See solution above
% 0.18/0.48 # Parsed axioms : 23
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 33
% 0.18/0.48 # Removed in clause preprocessing : 15
% 0.18/0.48 # Initial clauses in saturation : 18
% 0.18/0.48 # Processed clauses : 73
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 16
% 0.18/0.48 # ...remaining for further processing : 57
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 41
% 0.18/0.48 # ...of the previous two non-redundant : 37
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 41
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 0
% 0.18/0.48 # ...of those cached : 0
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 39
% 0.18/0.48 # Positive orientable unit clauses : 1
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 1
% 0.18/0.48 # Non-unit-clauses : 37
% 0.18/0.48 # Current number of unprocessed clauses: 0
% 0.18/0.48 # ...number of literals in the above : 0
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 19
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 323
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 216
% 0.18/0.48 # Non-unit clause-clause subsumptions : 16
% 0.18/0.48 # Unit Clause-clause subsumption calls : 0
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 2773
% 0.18/0.48 # Search garbage collected termcells : 515
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.008 s
% 0.18/0.48 # System time : 0.003 s
% 0.18/0.48 # Total time : 0.011 s
% 0.18/0.48 # Maximum resident set size: 1796 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.029 s
% 0.18/0.48 # System time : 0.009 s
% 0.18/0.48 # Total time : 0.038 s
% 0.18/0.48 # Maximum resident set size: 1712 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------