TSTP Solution File: ALG353-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG353-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:13:08 EDT 2024
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_CHAINED_0,axiom,
( ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_5,plain,
( ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_6,plain,
( ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_5 ).
cnf(c_0_7,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_conjecture_2 ).
cnf(c_0_8,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_Complex_Oii,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_conjecture_3 ).
cnf(c_0_9,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Oplus__class_Oplus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_conjecture_0 ).
cnf(c_0_10,negated_conjecture,
c_lessequals(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(c_HOL_Ominus__class_Ominus(v_z,c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_conjecture_1 ).
cnf(c_0_11,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG353-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n032.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Sat May 18 23:51:22 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.42 Running first-order model finding
% 0.18/0.42 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/benchmark/theBenchmark.p
% 0.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_1 with pid 22206 completed with status 0
% 0.18/0.47 # Result found by new_bool_1
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.18/0.47 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.18/0.47 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 22208 completed with status 0
% 0.18/0.47 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.18/0.47 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.18/0.47 # Preprocessing time : 0.004 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 745
% 0.18/0.47 # Removed by relevancy pruning/SinE : 674
% 0.18/0.47 # Initial clauses : 71
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 71
% 0.18/0.47 # Processed clauses : 71
% 0.18/0.47 # ...of these trivial : 3
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 67
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 2
% 0.18/0.47 # Generated clauses : 0
% 0.18/0.47 # ...of the previous two non-redundant : 1
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 0
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 13
% 0.18/0.47 # ...of those cached : 0
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 65
% 0.18/0.47 # Positive orientable unit clauses : 32
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 31
% 0.18/0.47 # Current number of unprocessed clauses: 1
% 0.18/0.47 # ...number of literals in the above : 1
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 2
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 254
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 169
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 0
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 4
% 0.18/0.47 # BW rewrite match successes : 2
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 8366
% 0.18/0.47 # Search garbage collected termcells : 2229
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.004 s
% 0.18/0.47 # System time : 0.005 s
% 0.18/0.47 # Total time : 0.009 s
% 0.18/0.47 # Maximum resident set size: 2344 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.015 s
% 0.18/0.47 # System time : 0.006 s
% 0.18/0.47 # Total time : 0.021 s
% 0.18/0.47 # Maximum resident set size: 2184 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------