↑ Up

CSE---1.7.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n008.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 : Tue May  5 06:57:11 PM UTC 2026

% Result   : Unsatisfiable 0.48s 0.58s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.09  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.29  % Computer : n008.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8042.1875MB
% 0.11/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29  % CPULimit   : 300
% 0.11/0.29  % WCLimit    : 300
% 0.11/0.29  % DateTime   : Tue May  5 13:07:13 EDT 2026
% 0.11/0.29  % CPUTime    : 
% 0.32/0.52  start to proof:theBenchmark
% 0.48/0.58  %-------------------------------------------
% 0.48/0.58  % File        :CSE---1.7
% 0.48/0.58  % Problem     :theBenchmark
% 0.48/0.58  % Transform   :cnf
% 0.48/0.58  % Format      :tptp:raw
% 0.48/0.58  % Command     :java -jar mcs_scs.jar %d %s
% 0.48/0.58  
% 0.48/0.58  % Result      :Theorem 0.020000s
% 0.48/0.58  % Output      :CNFRefutation 0.020000s
% 0.48/0.58  %-------------------------------------------
% 0.48/0.58  %------------------------------------------------------------------------------
% 0.48/0.58  % File     : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.48/0.58  % Domain   : Software Verification
% 0.48/0.58  % Problem  : Simple test case for recursion
% 0.48/0.58  % Version  : Especial.
% 0.48/0.58  % English  :
% 0.48/0.58  
% 0.48/0.58  % Refs     : [CST26] Claessen et al. (2026), Email to Geoff Sutcliffe
% 0.48/0.58  % Source   : [CST26]
% 0.48/0.58  % Names    : Rec_prop1.p [CST26]
% 0.48/0.58  
% 0.48/0.58  % Status   : Unsatisfiable
% 0.48/0.58  % Rating   : ? v9.3.0
% 0.48/0.58  % Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   7 RR)
% 0.48/0.58  %            Number of literals    :   13 (  13 equ;   1 neg)
% 0.48/0.58  %            Maximal clause size   :    1 (   1 avg)
% 0.48/0.58  %            Maximal term depth    :    3 (   1 avg)
% 0.48/0.58  %            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
% 0.48/0.58  %            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
% 0.48/0.58  %            Number of variables   :    9 (   5 sgn)
% 0.48/0.58  % SPC      : CNF_UNS_RFO_PEQ_UEQ
% 0.48/0.58  
% 0.48/0.58  % Comments :
% 0.48/0.58  %------------------------------------------------------------------------------
% 0.48/0.58  cnf(axiom,axiom,
% 0.48/0.58      aux(Z,btrue) = bfalse ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_001,axiom,
% 0.48/0.58      aux(Z,bfalse) = btrue ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_002,axiom,
% 0.48/0.58      h(nil) = nil ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_003,axiom,
% 0.48/0.58      h(cons(Y,Xs)) = Xs ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_004,axiom,
% 0.48/0.58      g(btrue) = bfalse ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_005,axiom,
% 0.48/0.58      g(bfalse) = btrue ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_006,axiom,
% 0.48/0.58      f(nil) = btrue ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_007,axiom,
% 0.48/0.58      f(cons(Y,Z)) = aux(Z,f(Z)) ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_008,axiom,
% 0.48/0.58      prop1(X) = eq(f(X),bfalse) ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_009,axiom,
% 0.48/0.58      eq(bfalse,btrue) = bfalse ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_010,axiom,
% 0.48/0.58      eq(btrue,bfalse) = bfalse ).
% 0.48/0.58  
% 0.48/0.58  cnf(axiom_011,axiom,
% 0.48/0.58      eq(X,X) = btrue ).
% 0.48/0.58  
% 0.48/0.58  cnf(goal,negated_conjecture,
% 0.48/0.58      eq(prop1(X),bfalse) != btrue ).
% 0.48/0.58  
% 0.48/0.58  %------------------------------------------------------------------------------
% 0.48/0.58  %-------------------------------------------
% 0.48/0.58  % Proof found
% 0.48/0.58  % SZS status Theorem for theBenchmark
% 0.48/0.58  % SZS output start Proof
% 0.48/0.58  %ClaNum:24(EqnAxiom:12)
% 0.48/0.58  %VarNum:12(SingletonVarNum:8)
% 0.48/0.58  %MaxLitNum:1
% 0.48/0.58  %MaxfuncDepth:3
% 0.48/0.58  %SharedTerms:15
% 0.48/0.58  %goalClause: 24
% 0.48/0.58  %singleGoalClaCount:1
% 0.48/0.58  [13]E(f2(a1),a1)
% 0.48/0.58  [14]E(f6(a3),a4)
% 0.48/0.58  [15]E(f6(a4),a3)
% 0.48/0.58  [16]E(f7(a1),a3)
% 0.48/0.58  [17]E(f8(a3,a4),a4)
% 0.48/0.58  [18]E(f8(a4,a3),a4)
% 0.48/0.58  [19]E(f5(x191,a3),a4)
% 0.48/0.58  [20]E(f5(x201,a4),a3)
% 0.48/0.58  [21]E(f8(x211,x211),a3)
% 0.48/0.58  [24]~E(f8(f8(f7(x241),a4),a4),a3)
% 0.48/0.58  [22]E(f2(f9(x221,x222)),x222)
% 0.48/0.58  [23]E(f7(f9(x231,x232)),f5(x232,f7(x232)))
% 0.48/0.58  %EqnAxiom
% 0.48/0.58  [1]E(x11,x11)
% 0.48/0.58  [2]E(x22,x21)+~E(x21,x22)
% 0.48/0.58  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.48/0.58  [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.48/0.58  [5]~E(x51,x52)+E(f6(x51),f6(x52))
% 0.48/0.58  [6]~E(x61,x62)+E(f8(x61,x63),f8(x62,x63))
% 0.48/0.58  [7]~E(x71,x72)+E(f8(x73,x71),f8(x73,x72))
% 0.48/0.58  [8]~E(x81,x82)+E(f7(x81),f7(x82))
% 0.48/0.58  [9]~E(x91,x92)+E(f9(x91,x93),f9(x92,x93))
% 0.48/0.58  [10]~E(x101,x102)+E(f9(x103,x101),f9(x103,x102))
% 0.48/0.58  [11]~E(x111,x112)+E(f5(x111,x113),f5(x112,x113))
% 0.48/0.58  [12]~E(x121,x122)+E(f5(x123,x121),f5(x123,x122))
% 0.48/0.58  
% 0.48/0.58  %-------------------------------------------
% 0.48/0.59  cnf(27,plain,
% 0.48/0.59     (~E(f8(f7(x271),a4),a4)),
% 0.48/0.59     inference(scs_inference,[],[24,21,2,3,6])).
% 0.48/0.59  cnf(31,plain,
% 0.48/0.59     (E(a4,f5(x311,a3))),
% 0.48/0.59     inference(scs_inference,[],[19,2])).
% 0.48/0.59  cnf(51,plain,
% 0.48/0.59     (E(a4,f8(a3,a4))),
% 0.48/0.59     inference(scs_inference,[],[17,2])).
% 0.48/0.59  cnf(52,plain,
% 0.48/0.59     (E(f8(a3,a4),f5(x521,a3))),
% 0.48/0.59     inference(scs_inference,[],[31,17,2,3])).
% 0.48/0.59  cnf(54,plain,
% 0.48/0.59     (E(f8(a4,a3),f8(a3,a4))),
% 0.48/0.59     inference(scs_inference,[],[51,52,18,2,3])).
% 0.48/0.59  cnf(56,plain,
% 0.48/0.59     (E(f6(a3),f8(a3,a4))),
% 0.48/0.59     inference(scs_inference,[],[51,54,14,2,3])).
% 0.48/0.59  cnf(57,plain,
% 0.48/0.59     (E(f8(a3,a4),f6(a3))),
% 0.48/0.59     inference(scs_inference,[],[56,2])).
% 0.48/0.59  cnf(69,plain,
% 0.48/0.59     (~E(f8(f7(x691),a4),f6(a3))),
% 0.48/0.59     inference(scs_inference,[],[27,14,22,2,3])).
% 0.48/0.59  cnf(71,plain,
% 0.48/0.59     ($false),
% 0.48/0.59     inference(scs_inference,[],[57,69,16,3,6]),
% 0.48/0.59     ['proof']).
% 0.48/0.59  % SZS output end Proof
% 0.48/0.59  % Total time :0.020000s
%------------------------------------------------------------------------------