TSTP Solution File: CSR088+6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR088+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 19:14:21 EDT 2024
% Result : ContradictoryAxioms 216.61s 28.90s
% Output : CNFRefutation 216.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 129 ( 33 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 146 ( 52 ~; 61 |; 26 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 69 ( 24 sgn 23 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_49882,axiom,
! [X2266] :
( s__instance(X2266,s__Train)
=> ? [X1,X15] :
( s__instance(X1,s__RollingStock)
& s__instance(X15,s__RollingStock)
& X1 != X15 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_49882) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X136,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X137,s__SetOrClass) )
=> ( ( s__instance(X1138,X136)
& s__instance(X34,X137)
& s__instance(X1139,X12) )
=> ( s__instance(X1138,X12)
& s__instance(X34,X12)
& ( s__instance(X1139,X136)
| s__instance(X1139,X137) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_49908,axiom,
! [X2266] :
( s__instance(X2266,s__Train)
=> ~ ? [X1,X15] :
( s__instance(X1,s__RollingStock)
& s__instance(X15,s__RollingStock)
& X1 != X15 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_49908) ).
fof(local_2,axiom,
s__instance(s__Time15_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_1895,axiom,
s__instance(s__rentalPrice__m,s__QuaternaryPredicate),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_1895) ).
fof(c_0_5,plain,
! [X2266] :
( s__instance(X2266,s__Train)
=> ? [X1,X15] :
( s__instance(X1,s__RollingStock)
& s__instance(X15,s__RollingStock)
& X1 != X15 ) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_49882]) ).
fof(c_0_6,plain,
! [X22748] :
( ( s__instance(esk2427_0,s__RollingStock)
| ~ s__instance(X22748,s__Train) )
& ( s__instance(esk2428_0,s__RollingStock)
| ~ s__instance(X22748,s__Train) )
& ( esk2427_0 != esk2428_0
| ~ s__instance(X22748,s__Train) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])]) ).
fof(c_0_7,plain,
! [X2589,X2590,X2591,X2592,X2593,X2594,X2595,X2596,X2597] :
( ( s__instance(X2592,X2590)
| ~ s__instance(X2592,X2591)
| ~ s__instance(X2593,X2589)
| ~ s__instance(X2594,X2590)
| ~ s__instance(X2591,s__SetOrClass)
| ~ s__instance(X2590,s__SetOrClass)
| ~ s__instance(X2589,s__SetOrClass)
| X2590 != s__UnionFn(X2591,X2589) )
& ( s__instance(X2593,X2590)
| ~ s__instance(X2592,X2591)
| ~ s__instance(X2593,X2589)
| ~ s__instance(X2594,X2590)
| ~ s__instance(X2591,s__SetOrClass)
| ~ s__instance(X2590,s__SetOrClass)
| ~ s__instance(X2589,s__SetOrClass)
| X2590 != s__UnionFn(X2591,X2589) )
& ( s__instance(X2594,X2591)
| s__instance(X2594,X2589)
| ~ s__instance(X2592,X2591)
| ~ s__instance(X2593,X2589)
| ~ s__instance(X2594,X2590)
| ~ s__instance(X2591,s__SetOrClass)
| ~ s__instance(X2590,s__SetOrClass)
| ~ s__instance(X2589,s__SetOrClass)
| X2590 != s__UnionFn(X2591,X2589) )
& ( s__instance(X2597,s__SetOrClass)
| X2596 = s__UnionFn(X2597,X2595) )
& ( s__instance(X2596,s__SetOrClass)
| X2596 = s__UnionFn(X2597,X2595) )
& ( s__instance(X2595,s__SetOrClass)
| X2596 = s__UnionFn(X2597,X2595) )
& ( s__instance(esk35_3(X2595,X2596,X2597),X2597)
| X2596 = s__UnionFn(X2597,X2595) )
& ( s__instance(esk36_3(X2595,X2596,X2597),X2595)
| X2596 = s__UnionFn(X2597,X2595) )
& ( s__instance(esk37_3(X2595,X2596,X2597),X2596)
| X2596 = s__UnionFn(X2597,X2595) )
& ( ~ s__instance(esk37_3(X2595,X2596,X2597),X2597)
| ~ s__instance(esk35_3(X2595,X2596,X2597),X2596)
| ~ s__instance(esk36_3(X2595,X2596,X2597),X2596)
| X2596 = s__UnionFn(X2597,X2595) )
& ( ~ s__instance(esk37_3(X2595,X2596,X2597),X2595)
| ~ s__instance(esk35_3(X2595,X2596,X2597),X2596)
| ~ s__instance(esk36_3(X2595,X2596,X2597),X2596)
| X2596 = s__UnionFn(X2597,X2595) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
cnf(c_0_8,plain,
( s__instance(esk2427_0,s__RollingStock)
| ~ s__instance(X1,s__Train) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( s__instance(esk37_3(X1,X2,X3),X2)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( s__instance(esk35_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( s__UnionFn(X1,X2) = s__Train
| s__instance(esk2427_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X1 = s__UnionFn(s__Train,X2)
| s__instance(esk2427_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,plain,
( s__instance(esk2428_0,s__RollingStock)
| ~ s__instance(X1,s__Train) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X2266] :
( s__instance(X2266,s__Train)
=> ~ ? [X1,X15] :
( s__instance(X1,s__RollingStock)
& s__instance(X15,s__RollingStock)
& X1 != X15 ) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_49908]) ).
cnf(c_0_15,plain,
( X1 = s__Train
| s__instance(esk2427_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( s__UnionFn(X1,X2) = s__Train
| s__instance(esk2428_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_17,plain,
( X1 = s__UnionFn(s__Train,X2)
| s__instance(esk2428_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
fof(c_0_18,plain,
! [X22751,X22752,X22753] :
( ~ s__instance(X22751,s__Train)
| ~ s__instance(X22752,s__RollingStock)
| ~ s__instance(X22753,s__RollingStock)
| X22752 = X22753 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_19,plain,
( s__instance(esk2427_0,s__RollingStock)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_20,plain,
s__instance(s__Time15_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_21,plain,
( X1 = s__Train
| s__instance(esk2428_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( X2 = X3
| ~ s__instance(X1,s__Train)
| ~ s__instance(X2,s__RollingStock)
| ~ s__instance(X3,s__RollingStock) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
s__instance(esk2427_0,s__RollingStock),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( s__instance(esk2428_0,s__RollingStock)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_25,plain,
( X1 = esk2427_0
| ~ s__instance(X1,s__RollingStock)
| ~ s__instance(X2,s__Train) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
s__instance(esk2428_0,s__RollingStock),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,plain,
( esk2427_0 != esk2428_0
| ~ s__instance(X1,s__Train) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,plain,
~ s__instance(X1,s__Train),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,plain,
( s__instance(esk36_3(X1,X2,X3),X1)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,plain,
s__UnionFn(X1,X2) = s__Train,
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_31,plain,
( X1 = s__Train
| s__instance(esk36_3(X2,X1,X3),X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
s__instance(s__rentalPrice__m,s__QuaternaryPredicate),
inference(split_conjunct,[status(thm)],[kb_SUMO_1895]) ).
cnf(c_0_33,plain,
X1 = s__Train,
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR088+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:49:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 216.61/28.90 # Version: 3.1.0
% 216.61/28.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 216.61/28.90 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 216.61/28.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 216.61/28.90 # Starting new_bool_3 with 299s (1) cores
% 216.61/28.90 # Starting new_bool_1 with 299s (1) cores
% 216.61/28.90 # Starting sh5l with 299s (1) cores
% 216.61/28.90 # sh5l with pid 24399 completed with status 0
% 216.61/28.90 # Result found by sh5l
% 216.61/28.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 216.61/28.90 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 216.61/28.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 216.61/28.90 # Starting new_bool_3 with 299s (1) cores
% 216.61/28.90 # Starting new_bool_1 with 299s (1) cores
% 216.61/28.90 # Starting sh5l with 299s (1) cores
% 216.61/28.90 # SinE strategy is gf500_gu_R04_F100_L20000
% 216.61/28.90 # Search class: FGHSM-SMLM33-DFFFFFNN
% 216.61/28.90 # Scheduled 6 strats onto 1 cores with 297 seconds (297 total)
% 216.61/28.90 # Starting SAT001_MinMin_p005000_rr with 161s (1) cores
% 216.61/28.90 # SAT001_MinMin_p005000_rr with pid 24407 completed with status 0
% 216.61/28.90 # Result found by SAT001_MinMin_p005000_rr
% 216.61/28.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 216.61/28.90 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 216.61/28.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 216.61/28.90 # Starting new_bool_3 with 299s (1) cores
% 216.61/28.90 # Starting new_bool_1 with 299s (1) cores
% 216.61/28.90 # Starting sh5l with 299s (1) cores
% 216.61/28.90 # SinE strategy is gf500_gu_R04_F100_L20000
% 216.61/28.90 # Search class: FGHSM-SMLM33-DFFFFFNN
% 216.61/28.90 # Scheduled 6 strats onto 1 cores with 297 seconds (297 total)
% 216.61/28.90 # Starting SAT001_MinMin_p005000_rr with 161s (1) cores
% 216.61/28.90 # Preprocessing time : 0.263 s
% 216.61/28.90 # Presaturation interreduction done
% 216.61/28.90
% 216.61/28.90 # Proof found!
% 216.61/28.90 # SZS status ContradictoryAxioms
% 216.61/28.90 # SZS output start CNFRefutation
% See solution above
% 216.61/28.90 # Parsed axioms : 55590
% 216.61/28.90 # Removed by relevancy pruning/SinE : 46223
% 216.61/28.90 # Initial clauses : 16257
% 216.61/28.90 # Removed in clause preprocessing : 803
% 216.61/28.90 # Initial clauses in saturation : 15454
% 216.61/28.90 # Processed clauses : 33255
% 216.61/28.90 # ...of these trivial : 1117
% 216.61/28.90 # ...subsumed : 863
% 216.61/28.90 # ...remaining for further processing : 31275
% 216.61/28.90 # Other redundant clauses eliminated : 2674
% 216.61/28.90 # Clauses deleted for lack of memory : 0
% 216.61/28.90 # Backward-subsumed : 69
% 216.61/28.90 # Backward-rewritten : 9852
% 216.61/28.90 # Generated clauses : 104990
% 216.61/28.90 # ...of the previous two non-redundant : 104005
% 216.61/28.90 # ...aggressively subsumed : 0
% 216.61/28.90 # Contextual simplify-reflections : 2584
% 216.61/28.90 # Paramodulations : 102335
% 216.61/28.90 # Factorizations : 0
% 216.61/28.90 # NegExts : 0
% 216.61/28.90 # Equation resolutions : 2677
% 216.61/28.90 # Disequality decompositions : 0
% 216.61/28.90 # Total rewrite steps : 4299
% 216.61/28.90 # ...of those cached : 0
% 216.61/28.90 # Propositional unsat checks : 9
% 216.61/28.90 # Propositional check models : 6
% 216.61/28.90 # Propositional check unsatisfiable : 0
% 216.61/28.90 # Propositional clauses : 0
% 216.61/28.90 # Propositional clauses after purity: 0
% 216.61/28.90 # Propositional unsat core size : 0
% 216.61/28.90 # Propositional preprocessing time : 0.000
% 216.61/28.90 # Propositional encoding time : 0.465
% 216.61/28.90 # Propositional solver time : 0.237
% 216.61/28.90 # Success case prop preproc time : 0.000
% 216.61/28.90 # Success case prop encoding time : 0.000
% 216.61/28.90 # Success case prop solver time : 0.000
% 216.61/28.90 # Current number of processed clauses : 3619
% 216.61/28.90 # Positive orientable unit clauses : 1786
% 216.61/28.90 # Positive unorientable unit clauses: 1
% 216.61/28.90 # Negative unit clauses : 13
% 216.61/28.90 # Non-unit-clauses : 1819
% 216.61/28.90 # Current number of unprocessed clauses: 41667
% 216.61/28.90 # ...number of literals in the above : 175610
% 216.61/28.90 # Current number of archived formulas : 0
% 216.61/28.90 # Current number of archived clauses : 25215
% 216.61/28.90 # Clause-clause subsumption calls (NU) : 79877903
% 216.61/28.90 # Rec. Clause-clause subsumption calls : 6914626
% 216.61/28.90 # Non-unit clause-clause subsumptions : 3484
% 216.61/28.90 # Unit Clause-clause subsumption calls : 1884617
% 216.61/28.90 # Rewrite failures with RHS unbound : 3
% 216.61/28.90 # BW rewrite match attempts : 20123
% 216.61/28.90 # BW rewrite match successes : 6427
% 216.61/28.90 # Condensation attempts : 0
% 216.61/28.90 # Condensation successes : 0
% 216.61/28.90 # Termbank termtop insertions : 3974596
% 216.61/28.90 # Search garbage collected termcells : 501441
% 216.61/28.90
% 216.61/28.90 # -------------------------------------------------
% 216.61/28.90 # User time : 25.815 s
% 216.61/28.90 # System time : 0.913 s
% 216.61/28.90 # Total time : 26.728 s
% 216.61/28.90 # Maximum resident set size: 167004 pages
% 216.61/28.90
% 216.61/28.90 # -------------------------------------------------
% 216.61/28.90 # User time : 26.845 s
% 216.61/28.90 # System time : 0.977 s
% 216.61/28.90 # Total time : 27.822 s
% 216.61/28.90 # Maximum resident set size: 57424 pages
% 216.61/28.90 % E---3.1 exiting
% 216.61/28.90 % E exiting
%------------------------------------------------------------------------------