TSTP Solution File: KRS038+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS038+1 : TPTP v8.2.0. 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 : Mon May 20 23:17:09 EDT 2024
% Result : Satisfiable 0.20s 0.50s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_10)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_11,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_12,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_14,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,esk1_1(X2))
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[final] ).
cnf(c_0_15,plain,
( rr(X1,esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_16,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_17,plain,
( rr(X1,esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[final] ).
cnf(c_0_18,plain,
( cp1(X3)
| ~ rinvR(esk2_1(X1),X2)
| ~ rr(X2,X3)
| ~ cp1(X2)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_19,plain,
( rinvR(esk2_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[final] ).
cnf(c_0_20,plain,
( cp1(X1)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_21,plain,
( cp1(X1)
| ~ rr(X2,X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[final] ).
cnf(c_0_22,plain,
( rr(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))
| cSatisfiable(X1)
| ~ rr(X2,X3)
| ~ cp1(X3)
| ~ rr(X1,X2)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_23,plain,
( cp1(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_24,plain,
( cp1(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]),
[final] ).
cnf(c_0_25,plain,
( rinvR(X1,esk3_3(X2,X3,X1))
| cSatisfiable(X2)
| ~ rr(X3,X1)
| ~ cp1(X1)
| ~ rr(X2,X3)
| ~ cp1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_26,plain,
( cp1(esk3_3(X1,X2,X3))
| cSatisfiable(X1)
| ~ rr(X2,X3)
| ~ cp1(X3)
| ~ rr(X1,X2)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_29,plain,
( rr(esk3_3(X1,X2,esk2_1(X2)),esk4_3(X1,X2,esk2_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),
[final] ).
cnf(c_0_30,plain,
( rr(esk3_3(X1,X2,esk1_1(X2)),esk4_3(X1,X2,esk1_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_24]),
[final] ).
cnf(c_0_31,plain,
( rinvR(esk2_1(X1),esk3_3(X2,X1,esk2_1(X1)))
| cSatisfiable(X2)
| ~ rr(X2,X1)
| ~ cp1(X2)
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_23]),
[final] ).
cnf(c_0_32,plain,
( rinvR(esk1_1(X1),esk3_3(X2,X1,esk1_1(X1)))
| cSatisfiable(X2)
| ~ rr(X2,X1)
| ~ cp1(X2)
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_24]),
[final] ).
cnf(c_0_33,plain,
( cp1(esk3_3(X1,X2,esk2_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_23]),
[final] ).
cnf(c_0_34,plain,
( cp1(esk3_3(X1,X2,esk1_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_24]),
[final] ).
cnf(c_0_35,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,X2)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]),
[final] ).
cnf(c_0_36,plain,
( rinvR(esk2_1(X1),esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]),
[final] ).
cnf(c_0_37,plain,
( rr(X1,esk1_1(X2))
| ~ rr(X1,X2)
| ~ cSatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]),
[final] ).
cnf(c_0_42,plain,
cSatisfiable(i2003_11_14_17_15_54995),
inference(split_conjunct,[status(thm)],[axiom_7]),
[final] ).
cnf(c_0_43,plain,
( rr(esk3_3(esk1_1(X1),esk2_1(X1),esk2_1(esk2_1(X1))),esk4_3(esk1_1(X1),esk2_1(X1),esk2_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_44,plain,
( rr(esk3_3(esk1_1(X1),esk2_1(X1),esk1_1(esk2_1(X1))),esk4_3(esk1_1(X1),esk2_1(X1),esk1_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_45,plain,
( rinvR(esk2_1(esk2_1(X1)),esk3_3(esk1_1(X1),esk2_1(X1),esk2_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_46,plain,
( rinvR(esk1_1(esk2_1(X1)),esk3_3(esk1_1(X1),esk2_1(X1),esk1_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_47,plain,
( rr(esk3_3(X1,esk1_1(X2),esk2_1(X2)),esk4_3(X1,esk1_1(X2),esk2_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,esk1_1(X2))
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_12]),c_0_23]),
[final] ).
cnf(c_0_48,plain,
( rinvR(esk2_1(X1),esk3_3(X2,esk1_1(X1),esk2_1(X1)))
| cSatisfiable(X2)
| ~ rr(X2,esk1_1(X1))
| ~ cp1(X2)
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_23]),
[final] ).
cnf(c_0_49,plain,
( cp1(esk3_3(esk1_1(X1),esk2_1(X1),esk2_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_50,plain,
( cp1(esk3_3(esk1_1(X1),esk2_1(X1),esk1_1(esk2_1(X1))))
| cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_12]),c_0_24]),
[final] ).
cnf(c_0_51,plain,
( rr(esk1_1(X1),esk2_1(esk2_1(X1)))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_12]),
[final] ).
cnf(c_0_52,plain,
( cp1(esk3_3(X1,esk1_1(X2),esk2_1(X2)))
| cSatisfiable(X1)
| ~ rr(X1,esk1_1(X2))
| ~ cp1(X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_23]),
[final] ).
cnf(c_0_53,plain,
( cp1(X1)
| ~ rr(esk1_1(X2),X1)
| ~ cSatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_36]),c_0_24]),
[final] ).
cnf(c_0_54,plain,
( rr(X1,esk2_1(esk1_1(X1)))
| ~ cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_15]),
[final] ).
cnf(c_0_55,plain,
( rr(X1,esk2_1(esk2_1(X1)))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]),
[final] ).
cnf(c_0_56,plain,
( rr(X1,esk1_1(esk2_1(X1)))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_17]),
[final] ).
cnf(c_0_57,plain,
( rr(esk1_1(X1),esk1_1(esk2_1(X1)))
| ~ cSatisfiable(esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_12]),
[final] ).
cnf(c_0_58,plain,
( rr(X1,esk1_1(esk1_1(X1)))
| ~ cSatisfiable(esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_15]),
[final] ).
cnf(c_0_59,plain,
( cSatisfiable(X1)
| ~ cp1(esk4_3(X1,X2,X3))
| ~ rr(X2,X3)
| ~ cp1(X3)
| ~ rr(X1,X2)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_60,plain,
( rinvR(esk1_1(X1),X1)
| ~ cSatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]),
[final] ).
cnf(c_0_61,plain,
( X2 = X3
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_62,plain,
( rinvF(X2,X1)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_63,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_64,plain,
( rf(X2,X1)
| ~ rinvF(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_65,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_66,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_67,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_68,plain,
cp1(i2003_11_14_17_15_54995),
inference(spm,[status(thm)],[c_0_20,c_0_42]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS038+1 : TPTP v8.2.0. Released v3.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 22:07:22 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11507 completed with status 1
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 11523 completed with status 1
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # No proof found!
% 0.20/0.50 # SZS status Satisfiable
% 0.20/0.50 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 22
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 34
% 0.20/0.51 # Removed in clause preprocessing : 15
% 0.20/0.51 # Initial clauses in saturation : 19
% 0.20/0.51 # Processed clauses : 78
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 8
% 0.20/0.51 # ...remaining for further processing : 70
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 56
% 0.20/0.51 # ...of the previous two non-redundant : 40
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 17
% 0.20/0.51 # Paramodulations : 56
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 51
% 0.20/0.51 # Positive orientable unit clauses : 2
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 48
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 20
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 873
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 315
% 0.20/0.51 # Non-unit clause-clause subsumptions : 25
% 0.20/0.51 # Unit Clause-clause subsumption calls : 1
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3795
% 0.20/0.51 # Search garbage collected termcells : 590
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.011 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1804 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.040 s
% 0.20/0.51 # System time : 0.009 s
% 0.20/0.51 # Total time : 0.049 s
% 0.20/0.51 # Maximum resident set size: 1716 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------