TSTP Solution File: CSR077+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR077+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:10 EDT 2024
% Result : Theorem 35.31s 5.33s
% Output : CNFRefutation 35.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 65 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 68 ( 28 ~; 29 |; 4 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 6 usr; 8 con; 0-1 aty)
% Number of variables : 29 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(kb_SUMO_3424,axiom,
! [X12] :
( s__instance(X12,s__RealNumber)
=> ( s__instance(X12,s__NegativeRealNumber)
=> s__SignumFn(X12) = "-1" ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3424) ).
fof(kb_SUMO_3422,axiom,
! [X12] :
( s__instance(X12,s__RealNumber)
=> ( s__instance(X12,s__NonnegativeRealNumber)
=> ( s__SignumFn(X12) = "1"
| s__SignumFn(X12) = "0" ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3422) ).
fof(kb_SUMO_842,axiom,
s__subclass(s__NonnegativeRealNumber,s__RealNumber),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_842) ).
fof(prove_from_SUMO,conjecture,
~ s__instance(s__Number3_1,s__NegativeRealNumber),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(local_1,axiom,
s__instance(s__Number3_1,s__NonnegativeRealNumber),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_7,plain,
! [X593,X594,X595] :
( ~ s__instance(X594,s__SetOrClass)
| ~ s__instance(X593,s__SetOrClass)
| ~ s__subclass(X593,X594)
| ~ s__instance(X595,X593)
| s__instance(X595,X594) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_8,plain,
! [X591,X592] :
( ( s__instance(X591,s__SetOrClass)
| ~ s__subclass(X591,X592) )
& ( s__instance(X592,s__SetOrClass)
| ~ s__subclass(X591,X592) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_9,plain,
( s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X609] :
( ~ s__instance(X609,s__RealNumber)
| ~ s__instance(X609,s__NegativeRealNumber)
| s__SignumFn(X609) = "-1" ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3424])])]) ).
fof(c_0_13,plain,
! [X622] :
( ~ s__instance(X622,s__RealNumber)
| ~ s__instance(X622,s__NonnegativeRealNumber)
| s__SignumFn(X622) = "1"
| s__SignumFn(X622) = "0" ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3422])])]) ).
cnf(c_0_14,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
s__subclass(s__NonnegativeRealNumber,s__RealNumber),
inference(split_conjunct,[status(thm)],[kb_SUMO_842]) ).
cnf(c_0_16,plain,
( s__SignumFn(X1) = "-1"
| ~ s__instance(X1,s__RealNumber)
| ~ s__instance(X1,s__NegativeRealNumber) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( s__SignumFn(X1) = "1"
| s__SignumFn(X1) = "0"
| ~ s__instance(X1,s__RealNumber)
| ~ s__instance(X1,s__NonnegativeRealNumber) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( s__instance(X1,s__RealNumber)
| ~ s__instance(X1,s__NonnegativeRealNumber) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( s__SignumFn(X1) = "1"
| ~ s__instance(X1,s__NegativeRealNumber)
| ~ s__instance(X1,s__NonnegativeRealNumber) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
fof(c_0_20,negated_conjecture,
s__instance(s__Number3_1,s__NegativeRealNumber),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,s__NegativeRealNumber)
| ~ s__instance(X1,s__NonnegativeRealNumber) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
s__instance(s__Number3_1,s__NegativeRealNumber),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
s__instance(s__Number3_1,s__NonnegativeRealNumber),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR077+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 00:37:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/benchmark/theBenchmark.p
% 35.31/5.33 # Version: 3.1.0
% 35.31/5.33 # Preprocessing class: FMLLSMSLSSSNFFN.
% 35.31/5.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.31/5.33 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 35.31/5.33 # Starting new_bool_3 with 300s (1) cores
% 35.31/5.33 # Starting new_bool_1 with 300s (1) cores
% 35.31/5.33 # Starting sh5l with 300s (1) cores
% 35.31/5.33 # sh5l with pid 4096 completed with status 0
% 35.31/5.33 # Result found by sh5l
% 35.31/5.33 # Preprocessing class: FMLLSMSLSSSNFFN.
% 35.31/5.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.31/5.33 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 35.31/5.33 # Starting new_bool_3 with 300s (1) cores
% 35.31/5.33 # Starting new_bool_1 with 300s (1) cores
% 35.31/5.33 # Starting sh5l with 300s (1) cores
% 35.31/5.33 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.31/5.33 # Search class: FGHSM-SMLM31-MFFFFFNN
% 35.31/5.33 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.31/5.33 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 35.31/5.33 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 4099 completed with status 0
% 35.31/5.33 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 35.31/5.33 # Preprocessing class: FMLLSMSLSSSNFFN.
% 35.31/5.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.31/5.33 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 35.31/5.33 # Starting new_bool_3 with 300s (1) cores
% 35.31/5.33 # Starting new_bool_1 with 300s (1) cores
% 35.31/5.33 # Starting sh5l with 300s (1) cores
% 35.31/5.33 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.31/5.33 # Search class: FGHSM-SMLM31-MFFFFFNN
% 35.31/5.33 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.31/5.33 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 35.31/5.33 # Preprocessing time : 0.071 s
% 35.31/5.33 # Presaturation interreduction done
% 35.31/5.33
% 35.31/5.33 # Proof found!
% 35.31/5.33 # SZS status Theorem
% 35.31/5.33 # SZS output start CNFRefutation
% See solution above
% 35.31/5.33 # Parsed axioms : 14789
% 35.31/5.33 # Removed by relevancy pruning/SinE : 9018
% 35.31/5.33 # Initial clauses : 6583
% 35.31/5.33 # Removed in clause preprocessing : 60
% 35.31/5.33 # Initial clauses in saturation : 6523
% 35.31/5.33 # Processed clauses : 23047
% 35.31/5.33 # ...of these trivial : 1291
% 35.31/5.33 # ...subsumed : 1224
% 35.31/5.33 # ...remaining for further processing : 20532
% 35.31/5.33 # Other redundant clauses eliminated : 158
% 35.31/5.33 # Clauses deleted for lack of memory : 0
% 35.31/5.33 # Backward-subsumed : 167
% 35.31/5.33 # Backward-rewritten : 704
% 35.31/5.33 # Generated clauses : 105078
% 35.31/5.33 # ...of the previous two non-redundant : 100350
% 35.31/5.33 # ...aggressively subsumed : 0
% 35.31/5.33 # Contextual simplify-reflections : 427
% 35.31/5.33 # Paramodulations : 104922
% 35.31/5.33 # Factorizations : 7
% 35.31/5.33 # NegExts : 0
% 35.31/5.33 # Equation resolutions : 162
% 35.31/5.33 # Disequality decompositions : 0
% 35.31/5.33 # Total rewrite steps : 9308
% 35.31/5.33 # ...of those cached : 7134
% 35.31/5.33 # Propositional unsat checks : 5
% 35.31/5.33 # Propositional check models : 3
% 35.31/5.33 # Propositional check unsatisfiable : 0
% 35.31/5.33 # Propositional clauses : 0
% 35.31/5.33 # Propositional clauses after purity: 0
% 35.31/5.33 # Propositional unsat core size : 0
% 35.31/5.33 # Propositional preprocessing time : 0.000
% 35.31/5.33 # Propositional encoding time : 0.119
% 35.31/5.33 # Propositional solver time : 0.178
% 35.31/5.33 # Success case prop preproc time : 0.000
% 35.31/5.33 # Success case prop encoding time : 0.000
% 35.31/5.33 # Success case prop solver time : 0.000
% 35.31/5.33 # Current number of processed clauses : 13264
% 35.31/5.33 # Positive orientable unit clauses : 4569
% 35.31/5.33 # Positive unorientable unit clauses: 12
% 35.31/5.33 # Negative unit clauses : 12
% 35.31/5.33 # Non-unit-clauses : 8671
% 35.31/5.33 # Current number of unprocessed clauses: 60623
% 35.31/5.33 # ...number of literals in the above : 199088
% 35.31/5.33 # Current number of archived formulas : 0
% 35.31/5.33 # Current number of archived clauses : 7164
% 35.31/5.33 # Clause-clause subsumption calls (NU) : 10430564
% 35.31/5.33 # Rec. Clause-clause subsumption calls : 6026490
% 35.31/5.33 # Non-unit clause-clause subsumptions : 1737
% 35.31/5.33 # Unit Clause-clause subsumption calls : 831032
% 35.31/5.33 # Rewrite failures with RHS unbound : 77
% 35.31/5.33 # BW rewrite match attempts : 2760
% 35.31/5.33 # BW rewrite match successes : 400
% 35.31/5.33 # Condensation attempts : 0
% 35.31/5.33 # Condensation successes : 0
% 35.31/5.33 # Termbank termtop insertions : 1716586
% 35.31/5.33 # Search garbage collected termcells : 77635
% 35.31/5.33
% 35.31/5.33 # -------------------------------------------------
% 35.31/5.33 # User time : 4.379 s
% 35.31/5.33 # System time : 0.158 s
% 35.31/5.33 # Total time : 4.537 s
% 35.31/5.33 # Maximum resident set size: 28732 pages
% 35.31/5.33
% 35.31/5.33 # -------------------------------------------------
% 35.31/5.33 # User time : 4.533 s
% 35.31/5.33 # System time : 0.176 s
% 35.31/5.33 # Total time : 4.710 s
% 35.31/5.33 # Maximum resident set size: 12444 pages
% 35.31/5.33 % E---3.1 exiting
% 35.31/5.33 % E exiting
%------------------------------------------------------------------------------