↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : FLD071-1 : 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 : n025.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 0.49s 0.58s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : FLD071-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.37  % Computer : n025.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8042.1875MB
% 0.12/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37  % CPULimit   : 300
% 0.12/0.37  % WCLimit    : 300
% 0.12/0.37  % DateTime   : Wed Jun 19 10:17:39 EDT 2024
% 0.12/0.37  % CPUTime    : 
% 0.49/0.55  start to proof:theBenchmark
% 0.49/0.58  %-------------------------------------------
% 0.49/0.58  % File        :CSE---1.7
% 0.49/0.58  % Problem     :theBenchmark
% 0.49/0.58  % Transform   :cnf
% 0.49/0.58  % Format      :tptp:raw
% 0.49/0.58  % Command     :java -jar mcs_scs.jar %d %s
% 0.49/0.58  
% 0.49/0.58  % Result      :Theorem 0.000000s
% 0.49/0.58  % Output      :CNFRefutation 0.000000s
% 0.49/0.58  %-------------------------------------------
% 0.49/0.58  %--------------------------------------------------------------------------
% 0.49/0.58  % File     : FLD071-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.49/0.58  % Domain   : Field Theory (Ordered fields)
% 0.49/0.58  % Problem  : One-sided multiplication of two order relations, part 1
% 0.49/0.58  % Version  : [Dra93] axioms : Especial.
% 0.49/0.58  %            Theorem formulation : Functional with glxx axiom set.
% 0.49/0.58  % English  :
% 0.49/0.58  
% 0.49/0.58  % Refs     : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 0.49/0.58  % Source   : [Dra93]
% 0.49/0.58  % Names    :
% 0.49/0.58  
% 0.49/0.58  % Status   : Unsatisfiable
% 0.49/0.58  % Rating   : 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.1, 0.20 v4.0.0, 0.14 v3.4.0, 0.25 v3.3.0, 0.33 v3.1.0, 0.17 v2.7.0, 0.00 v2.6.0, 0.33 v2.5.0, 0.00 v2.1.0
% 0.49/0.58  % Syntax   : Number of clauses     :   32 (   8 unt;   3 nHn;  32 RR)
% 0.49/0.58  %            Number of literals    :   78 (   0 equ;  45 neg)
% 0.49/0.58  %            Maximal clause size   :    4 (   2 avg)
% 0.49/0.58  %            Maximal term depth    :    3 (   1 avg)
% 0.49/0.58  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-2 aty)
% 0.49/0.58  %            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
% 0.49/0.58  %            Number of variables   :   50 (   0 sgn)
% 0.49/0.58  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.49/0.58  
% 0.49/0.58  % Comments :
% 0.49/0.58  % Bugfixes : v2.1.0 - Bugfix in FLD001-0.ax
% 0.49/0.58  %--------------------------------------------------------------------------
% 0.49/0.58  include('Axioms/FLD001-0.ax').
% 0.49/0.58  %--------------------------------------------------------------------------
% 0.49/0.58  cnf(a_is_defined,hypothesis,
% 0.49/0.58      defined(a) ).
% 0.49/0.58  
% 0.49/0.58  cnf(b_is_defined,hypothesis,
% 0.49/0.58      defined(b) ).
% 0.49/0.58  
% 0.49/0.58  cnf(less_or_equal_3,negated_conjecture,
% 0.49/0.58      less_or_equal(additive_identity,a) ).
% 0.49/0.58  
% 0.49/0.58  cnf(less_or_equal_4,negated_conjecture,
% 0.49/0.58      less_or_equal(additive_identity,b) ).
% 0.49/0.58  
% 0.49/0.58  cnf(not_less_or_equal_5,negated_conjecture,
% 0.49/0.58      ~ less_or_equal(additive_identity,multiply(a,b)) ).
% 0.49/0.58  
% 0.49/0.58  %--------------------------------------------------------------------------
% 0.49/0.58  %-------------------------------------------
% 0.49/0.58  % Proof found
% 0.49/0.58  % SZS status Theorem for theBenchmark
% 0.49/0.58  % SZS output start Proof
% 0.49/0.59  %ClaNum:32(EqnAxiom:0)
% 0.49/0.59  %VarNum:128(SingletonVarNum:50)
% 0.49/0.59  %MaxLitNum:4
% 0.49/0.59  %MaxfuncDepth:2
% 0.49/0.59  %SharedTerms:13
% 0.49/0.59  %goalClause: 5 6 8
% 0.49/0.59  %singleGoalClaCount:3
% 0.49/0.59  [1]P1(a1)
% 0.49/0.59  [2]P1(a4)
% 0.49/0.59  [3]P1(a2)
% 0.49/0.59  [4]P1(a5)
% 0.49/0.59  [5]P2(a1,a2)
% 0.49/0.59  [6]P2(a1,a5)
% 0.49/0.59  [7]~P3(a1,a4)
% 0.49/0.59  [8]~P2(a1,f7(a2,a5))
% 0.49/0.59  [10]~P1(x101)+P3(x101,x101)
% 0.49/0.59  [9]~P1(x91)+P1(f6(x91))
% 0.49/0.59  [14]~P1(x141)+P3(f3(a1,x141),x141)
% 0.49/0.59  [15]~P1(x151)+P3(f7(a4,x151),x151)
% 0.49/0.59  [18]~P1(x181)+P3(f3(x181,f6(x181)),a1)
% 0.49/0.59  [12]~P3(x122,x121)+P3(x121,x122)
% 0.49/0.59  [11]~P1(x111)+P3(x111,a1)+P1(f8(x111))
% 0.49/0.59  [23]~P1(x231)+P3(x231,a1)+P3(f7(x231,f8(x231)),a4)
% 0.49/0.59  [20]~P2(x202,x201)+~P2(x201,x202)+P3(x201,x202)
% 0.49/0.59  [16]~P1(x162)+~P1(x161)+P1(f3(x161,x162))
% 0.49/0.59  [17]~P1(x172)+~P1(x171)+P1(f7(x171,x172))
% 0.49/0.59  [24]~P2(a1,x242)+~P2(a1,x241)+P2(a1,f7(x241,x242))
% 0.49/0.59  [25]~P1(x252)+~P1(x251)+P3(f3(x251,x252),f3(x252,x251))
% 0.49/0.59  [26]~P1(x262)+~P1(x261)+P3(f7(x261,x262),f7(x262,x261))
% 0.49/0.59  [19]~P3(x191,x193)+P3(x191,x192)+~P3(x193,x192)
% 0.49/0.59  [21]~P2(x213,x212)+P2(x211,x212)+~P3(x213,x211)
% 0.49/0.59  [22]~P2(x221,x223)+P2(x221,x222)+~P2(x223,x222)
% 0.49/0.59  [27]~P1(x272)+~P3(x271,x273)+P3(f3(x271,x272),f3(x273,x272))
% 0.49/0.59  [28]~P1(x282)+~P3(x281,x283)+P3(f7(x281,x282),f7(x283,x282))
% 0.49/0.59  [29]~P1(x292)+~P2(x291,x293)+P2(f3(x291,x292),f3(x293,x292))
% 0.49/0.59  [13]P2(x132,x131)+~P1(x131)+~P1(x132)+P2(x131,x132)
% 0.49/0.59  [30]~P1(x303)+~P1(x302)+~P1(x301)+P3(f3(x301,f3(x302,x303)),f3(f3(x301,x302),x303))
% 0.49/0.59  [31]~P1(x313)+~P1(x312)+~P1(x311)+P3(f7(x311,f7(x312,x313)),f7(f7(x311,x312),x313))
% 0.49/0.59  [32]~P1(x323)+~P1(x322)+~P1(x321)+P3(f3(f7(x321,x322),f7(x323,x322)),f7(f3(x321,x323),x322))
% 0.49/0.59  %EqnAxiom
% 0.49/0.59  
% 0.49/0.59  %-------------------------------------------
% 0.49/0.59  cnf(35,plain,
% 0.49/0.59     ($false),
% 0.49/0.59     inference(scs_inference,[],[5,6,8,7,12,24]),
% 0.49/0.59     ['proof']).
% 0.49/0.59  % SZS output end Proof
% 0.49/0.59  % Total time :0.000000s
%------------------------------------------------------------------------------