↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : FLD070-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n024.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 Jun 24 05:55:37 EDT 2024

% Result   : Unsatisfiable 11.55s 11.61s
% Output   : CNFRefutation 11.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : FLD070-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Wed Jun 19 11:04:39 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.21/0.56  start to proof:theBenchmark
% 11.55/11.60  %-------------------------------------------
% 11.55/11.60  % File        :CSE---1.7
% 11.55/11.60  % Problem     :theBenchmark
% 11.55/11.60  % Transform   :cnf
% 11.55/11.60  % Format      :tptp:raw
% 11.55/11.60  % Command     :java -jar mcs_scs.jar %d %s
% 11.55/11.60  
% 11.55/11.60  % Result      :Theorem 10.990000s
% 11.55/11.60  % Output      :CNFRefutation 10.990000s
% 11.55/11.60  %-------------------------------------------
% 11.55/11.60  %--------------------------------------------------------------------------
% 11.55/11.60  % File     : FLD070-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% 11.55/11.60  % Domain   : Field Theory (Ordered fields)
% 11.55/11.60  % Problem  : One-sided addition of two order relations
% 11.55/11.60  % Version  : [Dra93] axioms : Especial.
% 11.55/11.60  %            Theorem formulation : Relational with re axiom set.
% 11.55/11.60  % English  :
% 11.55/11.60  
% 11.55/11.60  % Refs     : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 11.55/11.60  % Source   : [Dra93]
% 11.55/11.60  % Names    :
% 11.55/11.60  
% 11.55/11.60  % Status   : Unsatisfiable
% 11.55/11.60  % Rating   : 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v3.1.0, 0.17 v2.7.0, 0.00 v2.6.0, 0.33 v2.5.0, 0.00 v2.4.0, 0.00 v2.2.1, 0.33 v2.1.0
% 11.55/11.60  % Syntax   : Number of clauses     :   33 (  10 unt;   3 nHn;  33 RR)
% 11.55/11.60  %            Number of literals    :   84 (   0 equ;  50 neg)
% 11.55/11.60  %            Maximal clause size   :    5 (   2 avg)
% 11.55/11.60  %            Maximal term depth    :    2 (   1 avg)
% 11.55/11.60  %            Number of predicates  :    4 (   4 usr;   0 prp; 1-3 aty)
% 11.55/11.60  %            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
% 11.55/11.60  %            Number of variables   :   73 (   0 sgn)
% 11.55/11.60  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 11.55/11.60  
% 11.55/11.60  % Comments :
% 11.55/11.60  % Bugfixes : v2.1.0 - Bugfix in FLD002-0.ax
% 11.55/11.60  %--------------------------------------------------------------------------
% 11.55/11.60  include('Axioms/FLD002-0.ax').
% 11.55/11.60  %--------------------------------------------------------------------------
% 11.55/11.60  cnf(a_is_defined,hypothesis,
% 11.55/11.60      defined(a) ).
% 11.55/11.60  
% 11.55/11.60  cnf(b_is_defined,hypothesis,
% 11.55/11.60      defined(b) ).
% 11.55/11.60  
% 11.55/11.60  cnf(c_is_defined,hypothesis,
% 11.55/11.60      defined(c) ).
% 11.55/11.60  
% 11.55/11.60  cnf(less_or_equal_4,negated_conjecture,
% 11.55/11.60      less_or_equal(additive_identity,a) ).
% 11.55/11.60  
% 11.55/11.60  cnf(less_or_equal_5,negated_conjecture,
% 11.55/11.60      less_or_equal(additive_identity,b) ).
% 11.55/11.60  
% 11.55/11.60  cnf(sum_6,negated_conjecture,
% 11.55/11.60      sum(a,b,c) ).
% 11.55/11.60  
% 11.55/11.60  cnf(not_less_or_equal_7,negated_conjecture,
% 11.55/11.60      ~ less_or_equal(additive_identity,c) ).
% 11.55/11.60  
% 11.55/11.60  %--------------------------------------------------------------------------
% 11.55/11.61  %-------------------------------------------
% 11.55/11.61  % Proof found
% 11.55/11.61  % SZS status Theorem for theBenchmark
% 11.55/11.61  % SZS output start Proof
% 11.55/11.61  %ClaNum:33(EqnAxiom:0)
% 11.55/11.61  %VarNum:162(SingletonVarNum:73)
% 11.55/11.61  %MaxLitNum:5
% 11.55/11.61  %MaxfuncDepth:1
% 11.55/11.61  %SharedTerms:15
% 11.55/11.61  %goalClause: 6 7 8 9
% 11.55/11.61  %singleGoalClaCount:4
% 11.55/11.61  [1]P1(a1)
% 11.55/11.61  [2]P1(a4)
% 11.55/11.61  [3]P1(a2)
% 11.55/11.61  [4]P1(a5)
% 11.55/11.61  [5]P1(a7)
% 11.55/11.61  [6]P2(a1,a2)
% 11.55/11.61  [7]P2(a1,a5)
% 11.55/11.61  [8]P3(a2,a5,a7)
% 11.55/11.61  [9]~P2(a1,a7)
% 11.55/11.61  [10]~P3(a1,a1,a4)
% 11.55/11.61  [16]~P1(x161)+P3(a1,x161,x161)
% 11.55/11.61  [17]~P1(x171)+P4(a4,x171,x171)
% 11.55/11.61  [11]~P1(x111)+P1(f6(x111))
% 11.55/11.61  [18]~P1(x181)+P3(f6(x181),x181,a1)
% 11.55/11.61  [25]~P3(x252,x251,x253)+P3(x251,x252,x253)
% 11.55/11.61  [26]~P4(x262,x261,x263)+P4(x261,x262,x263)
% 11.55/11.61  [19]~P1(x191)+P3(a1,x191,a1)+P1(f9(x191))
% 11.55/11.61  [23]~P1(x231)+P4(f9(x231),x231,a4)+P3(a1,x231,a1)
% 11.55/11.61  [22]~P2(x222,x221)+~P2(x221,x222)+P3(a1,x221,x222)
% 11.55/11.61  [13]~P1(x132)+~P1(x131)+P1(f3(x131,x132))
% 11.55/11.61  [14]~P1(x142)+~P1(x141)+P1(f8(x141,x142))
% 11.55/11.61  [20]~P1(x202)+~P1(x201)+P3(x201,x202,f3(x201,x202))
% 11.55/11.61  [21]~P1(x212)+~P1(x211)+P4(x211,x212,f8(x211,x212))
% 11.55/11.61  [15]~P2(x151,x153)+P2(x151,x152)+~P2(x153,x152)
% 11.55/11.61  [12]P2(x122,x121)+~P1(x121)+~P1(x122)+P2(x121,x122)
% 11.55/11.61  [24]~P4(x243,x242,x241)+P2(a1,x241)+~P2(a1,x242)+~P2(a1,x243)
% 11.55/11.61  [27]~P3(x273,x275,x271)+P2(x271,x272)+~P3(x274,x275,x272)+~P2(x273,x274)
% 11.55/11.61  [28]~P3(x281,x286,x284)+P3(x281,x282,x283)+~P3(x284,x285,x283)+~P3(x286,x285,x282)
% 11.55/11.61  [29]~P3(x296,x294,x291)+P3(x291,x292,x293)+~P3(x294,x292,x295)+~P3(x296,x295,x293)
% 11.55/11.61  [30]~P4(x301,x306,x304)+P4(x301,x302,x303)+~P4(x304,x305,x303)+~P4(x306,x305,x302)
% 11.55/11.61  [31]~P4(x316,x314,x311)+P4(x311,x312,x313)+~P4(x314,x312,x315)+~P4(x316,x315,x313)
% 11.55/11.61  [32]~P4(x325,x327,x322)+~P4(x324,x327,x321)+P3(x321,x322,x323)+~P3(x324,x325,x326)+~P4(x326,x327,x323)
% 11.55/11.61  [33]~P4(x337,x332,x335)+~P4(x336,x332,x334)+P4(x331,x332,x333)+~P3(x334,x335,x333)+~P3(x336,x337,x331)
% 11.55/11.61  %EqnAxiom
% 11.55/11.61  
% 11.55/11.61  %-------------------------------------------
% 11.55/11.61  cnf(38,plain,
% 11.55/11.61     (~P3(a1,a5,a1)),
% 11.55/11.61     inference(scs_inference,[],[6,8,9,1,12,24,27])).
% 11.55/11.61  cnf(49,plain,
% 11.55/11.61     (~P2(a5,a1)),
% 11.55/11.61     inference(scs_inference,[],[7,38,22])).
% 11.55/11.61  cnf(129,plain,
% 11.55/11.61     (P2(a7,a1)),
% 11.55/11.61     inference(scs_inference,[],[9,5,1,12])).
% 11.55/11.61  cnf(1440,plain,
% 11.55/11.61     (~P2(a5,a7)),
% 11.55/11.61     inference(scs_inference,[],[49,129,15])).
% 11.55/11.61  cnf(3726,plain,
% 11.55/11.61     (~P3(a1,a5,a5)),
% 11.55/11.61     inference(scs_inference,[],[8,6,1440,27])).
% 11.55/11.61  cnf(3729,plain,
% 11.55/11.61     ($false),
% 11.55/11.61     inference(scs_inference,[],[3726,4,16]),
% 11.55/11.61     ['proof']).
% 11.55/11.61  % SZS output end Proof
% 11.55/11.61  % Total time :10.990000s
%------------------------------------------------------------------------------