TSTP Solution File: KRS039+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS039+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:10 EDT 2024
% Result : Satisfiable 0.23s 0.53s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_6)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_8,plain,
( ~ rinvR(esk2_1(X1),X2)
| ~ rr1(X2,X3)
| ~ cp(X3)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_9,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
cnf(c_0_10,plain,
( cp(X3)
| ~ rinvR(esk1_1(X1),X2)
| ~ rr1(X2,X3)
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_11,plain,
( ~ cp(X1)
| ~ rr1(X2,X1)
| ~ rr(X2,esk2_1(X3))
| ~ cSatisfiable(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]),
[final] ).
cnf(c_0_12,plain,
( rr(X1,esk2_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_15,plain,
( cp(X1)
| ~ rr1(X2,X1)
| ~ rr(X2,esk1_1(X3))
| ~ cSatisfiable(X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]),
[final] ).
cnf(c_0_16,plain,
( rr(X1,esk1_1(X1))
| ~ cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_20,plain,
( ~ rr1(X1,X2)
| ~ cSatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[final] ).
cnf(c_0_21,plain,
( rr1(esk5_2(X1,X2),esk6_2(X1,X2))
| rr1(esk3_2(X1,X3),esk4_2(X1,X3))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_22,plain,
( rr1(esk5_2(X1,X2),esk6_2(X1,X2))
| rinvR(X3,esk3_2(X1,X3))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_23,plain,
( rinvR(X1,esk5_2(X2,X1))
| rr1(esk3_2(X2,X3),esk4_2(X2,X3))
| cSatisfiable(X2)
| ~ rr(X2,X1)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_24,plain,
( cp(esk6_2(X1,X2))
| rr1(esk3_2(X1,X3),esk4_2(X1,X3))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_25,plain,
( rinvR(X1,esk5_2(X2,X1))
| rinvR(X3,esk3_2(X2,X3))
| cSatisfiable(X2)
| ~ rr(X2,X1)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_26,plain,
( rr1(esk5_2(X1,X2),esk6_2(X1,X2))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp(esk4_2(X1,X3))
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_27,plain,
( rinvR(X1,esk5_2(X2,X1))
| cSatisfiable(X2)
| ~ rr(X2,X1)
| ~ cp(esk4_2(X2,X3))
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_28,plain,
( cp(esk6_2(X1,X2))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ cp(esk4_2(X1,X3))
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_29,plain,
( cp(esk6_2(X1,X2))
| rinvR(X3,esk3_2(X1,X3))
| cSatisfiable(X1)
| ~ rr(X1,X2)
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_30,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
cnf(c_0_31,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_32,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_33,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_34,plain,
cSatisfiable(i2003_11_14_17_15_58383),
inference(split_conjunct,[status(thm)],[axiom_4]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : KRS039+1 : TPTP v8.2.0. Released v3.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n011.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 21:58:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7052 completed with status 1
% 0.23/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # No SInE strategy applied
% 0.23/0.53 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.53 # Starting sh5l with 136s (1) cores
% 0.23/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7067 completed with status 1
% 0.23/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # No SInE strategy applied
% 0.23/0.53 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53
% 0.23/0.53 # No proof found!
% 0.23/0.53 # SZS status Satisfiable
% 0.23/0.53 # SZS output start Saturation
% See solution above
% 0.23/0.53 # Parsed axioms : 5
% 0.23/0.53 # Removed by relevancy pruning/SinE : 0
% 0.23/0.53 # Initial clauses : 20
% 0.23/0.53 # Removed in clause preprocessing : 1
% 0.23/0.53 # Initial clauses in saturation : 19
% 0.23/0.53 # Processed clauses : 23
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 23
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 1
% 0.23/0.53 # Backward-rewritten : 0
% 0.23/0.53 # Generated clauses : 18
% 0.23/0.53 # ...of the previous two non-redundant : 4
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 1
% 0.23/0.53 # Paramodulations : 18
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 0
% 0.23/0.53 # ...of those cached : 0
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 22
% 0.23/0.53 # Positive orientable unit clauses : 1
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 1
% 0.23/0.53 # Non-unit-clauses : 20
% 0.23/0.53 # Current number of unprocessed clauses: 0
% 0.23/0.53 # ...number of literals in the above : 0
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 2
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 175
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 65
% 0.23/0.53 # Non-unit clause-clause subsumptions : 2
% 0.23/0.53 # Unit Clause-clause subsumption calls : 0
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 0
% 0.23/0.53 # BW rewrite match successes : 0
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 1583
% 0.23/0.53 # Search garbage collected termcells : 294
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.007 s
% 0.23/0.53 # System time : 0.001 s
% 0.23/0.53 # Total time : 0.008 s
% 0.23/0.53 # Maximum resident set size: 1744 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.021 s
% 0.23/0.53 # System time : 0.007 s
% 0.23/0.53 # Total time : 0.028 s
% 0.23/0.53 # Maximum resident set size: 1692 pages
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------