TSTP Solution File: ALG371-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG371-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:06:12 EDT 2024
% Result : Unsatisfiable 0.81s 0.58s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 37 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_real__le__trans_0,axiom,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__le__trans_0) ).
cnf(cls_norm__ge__zero_0,axiom,
( c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X2,X1),tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_norm__ge__zero_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_RealVector_Onorm__class_Onorm(v_x,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector) ).
cnf(cls_linorder__not__le_1,axiom,
( ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_HOL_Oord__class_Oless(X3,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_linorder__not__le_1) ).
cnf(clsarity_RealDef__Oreal__Orderings_Olinorder,axiom,
class_Orderings_Olinorder(tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_RealDef__Oreal__Orderings_Olinorder) ).
cnf(cls_conjecture_0,negated_conjecture,
c_HOL_Oord__class_Oless(v_r,c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_7,plain,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_real__le__trans_0]) ).
cnf(c_0_8,plain,
( c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X2,X1),tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
inference(fof_simplification,[status(thm)],[cls_norm__ge__zero_0]) ).
cnf(c_0_9,plain,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
c_lessequals(c_RealVector_Onorm__class_Onorm(v_x,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
cls_conjecture_1 ).
cnf(c_0_11,plain,
( c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X2,X1),tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
c_0_8 ).
cnf(c_0_12,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector ).
cnf(c_0_13,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_HOL_Oord__class_Oless(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_linorder__not__le_1]) ).
cnf(c_0_14,negated_conjecture,
( c_lessequals(X1,v_r,tc_RealDef_Oreal)
| ~ c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_HOL_Oord__class_Oless(X3,X2,X1) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
class_Orderings_Olinorder(tc_RealDef_Oreal),
clsarity_RealDef__Oreal__Orderings_Olinorder ).
cnf(c_0_19,negated_conjecture,
c_HOL_Oord__class_Oless(v_r,c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal),
cls_conjecture_0 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG371-1 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 23:01:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 0.81/0.58 # Version: 3.1.0
% 0.81/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.81/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.81/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.81/0.58 # Starting sh5l with 300s (1) cores
% 0.81/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32508 completed with status 0
% 0.81/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.81/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.81/0.58 # No SInE strategy applied
% 0.81/0.58 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.81/0.58 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.58 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.81/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.81/0.58 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.81/0.58 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 0.81/0.58 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 32517 completed with status 0
% 0.81/0.58 # Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 0.81/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.81/0.58 # No SInE strategy applied
% 0.81/0.58 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.81/0.58 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.58 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.81/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.81/0.58 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.81/0.58 # Preprocessing time : 0.007 s
% 0.81/0.58 # Presaturation interreduction done
% 0.81/0.58
% 0.81/0.58 # Proof found!
% 0.81/0.58 # SZS status Unsatisfiable
% 0.81/0.58 # SZS output start CNFRefutation
% See solution above
% 0.81/0.58 # Parsed axioms : 504
% 0.81/0.58 # Removed by relevancy pruning/SinE : 0
% 0.81/0.58 # Initial clauses : 504
% 0.81/0.58 # Removed in clause preprocessing : 0
% 0.81/0.58 # Initial clauses in saturation : 504
% 0.81/0.58 # Processed clauses : 763
% 0.81/0.58 # ...of these trivial : 6
% 0.81/0.58 # ...subsumed : 123
% 0.81/0.58 # ...remaining for further processing : 634
% 0.81/0.58 # Other redundant clauses eliminated : 0
% 0.81/0.58 # Clauses deleted for lack of memory : 0
% 0.81/0.58 # Backward-subsumed : 3
% 0.81/0.58 # Backward-rewritten : 2
% 0.81/0.58 # Generated clauses : 294
% 0.81/0.58 # ...of the previous two non-redundant : 205
% 0.81/0.58 # ...aggressively subsumed : 0
% 0.81/0.58 # Contextual simplify-reflections : 1
% 0.81/0.58 # Paramodulations : 291
% 0.81/0.58 # Factorizations : 2
% 0.81/0.58 # NegExts : 0
% 0.81/0.58 # Equation resolutions : 1
% 0.81/0.58 # Disequality decompositions : 0
% 0.81/0.58 # Total rewrite steps : 202
% 0.81/0.58 # ...of those cached : 160
% 0.81/0.58 # Propositional unsat checks : 0
% 0.81/0.58 # Propositional check models : 0
% 0.81/0.58 # Propositional check unsatisfiable : 0
% 0.81/0.58 # Propositional clauses : 0
% 0.81/0.58 # Propositional clauses after purity: 0
% 0.81/0.58 # Propositional unsat core size : 0
% 0.81/0.58 # Propositional preprocessing time : 0.000
% 0.81/0.58 # Propositional encoding time : 0.000
% 0.81/0.58 # Propositional solver time : 0.000
% 0.81/0.58 # Success case prop preproc time : 0.000
% 0.81/0.58 # Success case prop encoding time : 0.000
% 0.81/0.58 # Success case prop solver time : 0.000
% 0.81/0.58 # Current number of processed clauses : 185
% 0.81/0.58 # Positive orientable unit clauses : 94
% 0.81/0.58 # Positive unorientable unit clauses: 1
% 0.81/0.58 # Negative unit clauses : 14
% 0.81/0.58 # Non-unit-clauses : 76
% 0.81/0.58 # Current number of unprocessed clauses: 389
% 0.81/0.58 # ...number of literals in the above : 1402
% 0.81/0.58 # Current number of archived formulas : 0
% 0.81/0.58 # Current number of archived clauses : 449
% 0.81/0.58 # Clause-clause subsumption calls (NU) : 20474
% 0.81/0.58 # Rec. Clause-clause subsumption calls : 7229
% 0.81/0.58 # Non-unit clause-clause subsumptions : 82
% 0.81/0.58 # Unit Clause-clause subsumption calls : 129
% 0.81/0.58 # Rewrite failures with RHS unbound : 0
% 0.81/0.58 # BW rewrite match attempts : 25
% 0.81/0.58 # BW rewrite match successes : 16
% 0.81/0.58 # Condensation attempts : 0
% 0.81/0.58 # Condensation successes : 0
% 0.81/0.58 # Termbank termtop insertions : 27013
% 0.81/0.58 # Search garbage collected termcells : 1150
% 0.81/0.58
% 0.81/0.58 # -------------------------------------------------
% 0.81/0.58 # User time : 0.064 s
% 0.81/0.58 # System time : 0.008 s
% 0.81/0.58 # Total time : 0.072 s
% 0.81/0.58 # Maximum resident set size: 2740 pages
% 0.81/0.58
% 0.81/0.58 # -------------------------------------------------
% 0.81/0.58 # User time : 0.297 s
% 0.81/0.58 # System time : 0.032 s
% 0.81/0.58 # Total time : 0.329 s
% 0.81/0.58 # Maximum resident set size: 2044 pages
% 0.81/0.58 % E---3.1 exiting
% 0.81/0.58 % E exiting
%------------------------------------------------------------------------------