TSTP Solution File: ALG387-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG387-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:15 EDT 2024
% Result : Unsatisfiable 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 6 unt; 2 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_v_0,axiom,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_v_0) ).
cnf(cls_v0_0,axiom,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_v0_0) ).
cnf(cls_ath_0,axiom,
( c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(X2,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(X2,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_ath_0) ).
cnf(c_0_4,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_5,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_v_0]) ).
cnf(c_0_6,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_v0_0]) ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
c_0_4 ).
cnf(c_0_8,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
c_0_5 ).
cnf(c_0_9,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_6 ).
cnf(c_0_10,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(X2,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(X2,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
cls_ath_0 ).
cnf(c_0_12,negated_conjecture,
~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ALG387-1 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 23:09:53 EDT 2024
% 0.17/0.32 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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.18/0.57 # Version: 3.1.0
% 0.18/0.57 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.18/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.57 # Starting sh5l with 300s (1) cores
% 0.18/0.57 # new_bool_1 with pid 21627 completed with status 0
% 0.18/0.57 # Result found by new_bool_1
% 0.18/0.57 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.18/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.57 # Search class: FGUSM-FFLM32-MFFFFFNN
% 0.18/0.57 # partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.18/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.57 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 21629 completed with status 0
% 0.18/0.57 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.18/0.57 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.18/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.57 # Search class: FGUSM-FFLM32-MFFFFFNN
% 0.18/0.57 # partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.18/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.57 # Preprocessing time : 0.021 s
% 0.18/0.57
% 0.18/0.57 # Proof found!
% 0.18/0.57 # SZS status Unsatisfiable
% 0.18/0.57 # SZS output start CNFRefutation
% See solution above
% 0.18/0.57 # Parsed axioms : 884
% 0.18/0.57 # Removed by relevancy pruning/SinE : 772
% 0.18/0.57 # Initial clauses : 112
% 0.18/0.57 # Removed in clause preprocessing : 0
% 0.18/0.57 # Initial clauses in saturation : 112
% 0.18/0.57 # Processed clauses : 151
% 0.18/0.57 # ...of these trivial : 0
% 0.18/0.57 # ...subsumed : 18
% 0.18/0.57 # ...remaining for further processing : 133
% 0.18/0.57 # Other redundant clauses eliminated : 0
% 0.18/0.57 # Clauses deleted for lack of memory : 0
% 0.18/0.57 # Backward-subsumed : 1
% 0.18/0.57 # Backward-rewritten : 1
% 0.18/0.57 # Generated clauses : 877
% 0.18/0.57 # ...of the previous two non-redundant : 805
% 0.18/0.57 # ...aggressively subsumed : 0
% 0.18/0.57 # Contextual simplify-reflections : 0
% 0.18/0.57 # Paramodulations : 873
% 0.18/0.57 # Factorizations : 2
% 0.18/0.57 # NegExts : 0
% 0.18/0.57 # Equation resolutions : 2
% 0.18/0.57 # Disequality decompositions : 0
% 0.18/0.57 # Total rewrite steps : 355
% 0.18/0.57 # ...of those cached : 321
% 0.18/0.57 # Propositional unsat checks : 0
% 0.18/0.57 # Propositional check models : 0
% 0.18/0.57 # Propositional check unsatisfiable : 0
% 0.18/0.57 # Propositional clauses : 0
% 0.18/0.57 # Propositional clauses after purity: 0
% 0.18/0.57 # Propositional unsat core size : 0
% 0.18/0.57 # Propositional preprocessing time : 0.000
% 0.18/0.57 # Propositional encoding time : 0.000
% 0.18/0.57 # Propositional solver time : 0.000
% 0.18/0.57 # Success case prop preproc time : 0.000
% 0.18/0.57 # Success case prop encoding time : 0.000
% 0.18/0.57 # Success case prop solver time : 0.000
% 0.18/0.57 # Current number of processed clauses : 131
% 0.18/0.57 # Positive orientable unit clauses : 19
% 0.18/0.57 # Positive unorientable unit clauses: 2
% 0.18/0.57 # Negative unit clauses : 10
% 0.18/0.57 # Non-unit-clauses : 100
% 0.18/0.57 # Current number of unprocessed clauses: 759
% 0.18/0.57 # ...number of literals in the above : 1924
% 0.18/0.57 # Current number of archived formulas : 0
% 0.18/0.57 # Current number of archived clauses : 2
% 0.18/0.57 # Clause-clause subsumption calls (NU) : 842
% 0.18/0.57 # Rec. Clause-clause subsumption calls : 791
% 0.18/0.57 # Non-unit clause-clause subsumptions : 10
% 0.18/0.57 # Unit Clause-clause subsumption calls : 25
% 0.18/0.57 # Rewrite failures with RHS unbound : 0
% 0.18/0.57 # BW rewrite match attempts : 12
% 0.18/0.57 # BW rewrite match successes : 7
% 0.18/0.57 # Condensation attempts : 0
% 0.18/0.57 # Condensation successes : 0
% 0.18/0.57 # Termbank termtop insertions : 26635
% 0.18/0.57 # Search garbage collected termcells : 2653
% 0.18/0.57
% 0.18/0.57 # -------------------------------------------------
% 0.18/0.57 # User time : 0.051 s
% 0.18/0.57 # System time : 0.006 s
% 0.18/0.57 # Total time : 0.057 s
% 0.18/0.57 # Maximum resident set size: 2524 pages
% 0.18/0.57
% 0.18/0.57 # -------------------------------------------------
% 0.18/0.57 # User time : 0.076 s
% 0.18/0.57 # System time : 0.011 s
% 0.18/0.57 # Total time : 0.086 s
% 0.18/0.57 # Maximum resident set size: 2288 pages
% 0.18/0.57 % E---3.1 exiting
% 0.18/0.57 % E exiting
%------------------------------------------------------------------------------