TSTP Solution File: ALG383-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG383-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 07:23:47 EDT 2024
% Result : Unsatisfiable 0.41s 0.83s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 10 ( 0 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/sandbox/tmp/tmp.wqAKiGLH0i/E---3.1_14972.p',cls_real__le__trans_0) ).
cnf(cls_th2_0,axiom,
c_lessequals(c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/tmp/tmp.wqAKiGLH0i/E---3.1_14972.p',cls_th2_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/tmp/tmp.wqAKiGLH0i/E---3.1_14972.p',cls_conjecture_0) ).
cnf(cls_th1_0,axiom,
c_lessequals(v_da____,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal),
file('/export/starexec/sandbox/tmp/tmp.wqAKiGLH0i/E---3.1_14972.p',cls_th1_0) ).
cnf(c_0_4,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_5,plain,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
c_0_4 ).
cnf(c_0_6,axiom,
c_lessequals(c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_th2_0 ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( c_lessequals(X1,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(X1,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
c_lessequals(v_da____,c_HOL_Ominus__class_Ominus(c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(v_z____,c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(v_aa____,tc_Complex_Ocomplex),tc_RealDef_Oreal),tc_RealDef_Oreal),
cls_th1_0 ).
cnf(c_0_10,negated_conjecture,
~ c_lessequals(v_da____,c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_aa____,c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_z____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
c_0_7 ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG383-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.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 : Fri May 3 13:46:18 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.19/0.54 Running first-order model finding
% 0.19/0.54 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.wqAKiGLH0i/E---3.1_14972.p
% 0.41/0.83 # Version: 3.1.0
% 0.41/0.83 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.83 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/0.83 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.83 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.83 # Starting sh5l with 300s (1) cores
% 0.41/0.83 # sh5l with pid 15052 completed with status 0
% 0.41/0.83 # Result found by sh5l
% 0.41/0.83 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.83 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/0.83 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.83 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.83 # Starting sh5l with 300s (1) cores
% 0.41/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/0.83 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.41/0.83 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.83 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.41/0.83 # G-E--_303_C18_F1_URBAN_S0Y with pid 15060 completed with status 0
% 0.41/0.83 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.41/0.83 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.83 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/0.83 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.83 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.83 # Starting sh5l with 300s (1) cores
% 0.41/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/0.83 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.41/0.83 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.83 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.41/0.83 # Preprocessing time : 0.033 s
% 0.41/0.83
% 0.41/0.83 # Proof found!
% 0.41/0.83 # SZS status Unsatisfiable
% 0.41/0.83 # SZS output start CNFRefutation
% See solution above
% 0.41/0.83 # Parsed axioms : 987
% 0.41/0.83 # Removed by relevancy pruning/SinE : 162
% 0.41/0.83 # Initial clauses : 825
% 0.41/0.83 # Removed in clause preprocessing : 0
% 0.41/0.83 # Initial clauses in saturation : 825
% 0.41/0.83 # Processed clauses : 1116
% 0.41/0.83 # ...of these trivial : 16
% 0.41/0.83 # ...subsumed : 276
% 0.41/0.83 # ...remaining for further processing : 824
% 0.41/0.83 # Other redundant clauses eliminated : 3
% 0.41/0.83 # Clauses deleted for lack of memory : 0
% 0.41/0.83 # Backward-subsumed : 1
% 0.41/0.83 # Backward-rewritten : 5
% 0.41/0.83 # Generated clauses : 9492
% 0.41/0.83 # ...of the previous two non-redundant : 8902
% 0.41/0.83 # ...aggressively subsumed : 0
% 0.41/0.83 # Contextual simplify-reflections : 0
% 0.41/0.83 # Paramodulations : 9475
% 0.41/0.83 # Factorizations : 6
% 0.41/0.83 # NegExts : 0
% 0.41/0.83 # Equation resolutions : 11
% 0.41/0.83 # Disequality decompositions : 0
% 0.41/0.83 # Total rewrite steps : 4542
% 0.41/0.83 # ...of those cached : 4306
% 0.41/0.83 # Propositional unsat checks : 0
% 0.41/0.83 # Propositional check models : 0
% 0.41/0.83 # Propositional check unsatisfiable : 0
% 0.41/0.83 # Propositional clauses : 0
% 0.41/0.83 # Propositional clauses after purity: 0
% 0.41/0.83 # Propositional unsat core size : 0
% 0.41/0.83 # Propositional preprocessing time : 0.000
% 0.41/0.83 # Propositional encoding time : 0.000
% 0.41/0.83 # Propositional solver time : 0.000
% 0.41/0.83 # Success case prop preproc time : 0.000
% 0.41/0.83 # Success case prop encoding time : 0.000
% 0.41/0.83 # Success case prop solver time : 0.000
% 0.41/0.83 # Current number of processed clauses : 818
% 0.41/0.83 # Positive orientable unit clauses : 150
% 0.41/0.83 # Positive unorientable unit clauses: 2
% 0.41/0.83 # Negative unit clauses : 33
% 0.41/0.83 # Non-unit-clauses : 633
% 0.41/0.83 # Current number of unprocessed clauses: 8597
% 0.41/0.83 # ...number of literals in the above : 24803
% 0.41/0.83 # Current number of archived formulas : 0
% 0.41/0.83 # Current number of archived clauses : 6
% 0.41/0.83 # Clause-clause subsumption calls (NU) : 50133
% 0.41/0.83 # Rec. Clause-clause subsumption calls : 30816
% 0.41/0.83 # Non-unit clause-clause subsumptions : 164
% 0.41/0.83 # Unit Clause-clause subsumption calls : 790
% 0.41/0.83 # Rewrite failures with RHS unbound : 0
% 0.41/0.83 # BW rewrite match attempts : 327
% 0.41/0.83 # BW rewrite match successes : 37
% 0.41/0.83 # Condensation attempts : 0
% 0.41/0.83 # Condensation successes : 0
% 0.41/0.83 # Termbank termtop insertions : 174883
% 0.41/0.83 # Search garbage collected termcells : 1947
% 0.41/0.83
% 0.41/0.83 # -------------------------------------------------
% 0.41/0.83 # User time : 0.230 s
% 0.41/0.83 # System time : 0.014 s
% 0.41/0.83 # Total time : 0.244 s
% 0.41/0.83 # Maximum resident set size: 3564 pages
% 0.41/0.83
% 0.41/0.83 # -------------------------------------------------
% 0.41/0.83 # User time : 0.254 s
% 0.41/0.83 # System time : 0.015 s
% 0.41/0.83 # Total time : 0.270 s
% 0.41/0.83 # Maximum resident set size: 2368 pages
% 0.41/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------