TSTP Solution File: SWV009-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 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 : Thu Aug 31 21:31:33 EDT 2023
% Result : Unsatisfiable 0.19s 0.63s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n025.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 : Tue Aug 29 09:44:55 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 0.19/0.63 %-------------------------------------------
% 0.19/0.63 % File :CSE---1.6
% 0.19/0.63 % Problem :theBenchmark
% 0.19/0.63 % Transform :cnf
% 0.19/0.63 % Format :tptp:raw
% 0.19/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.63
% 0.19/0.63 % Result :Theorem 0.000000s
% 0.19/0.63 % Output :CNFRefutation 0.000000s
% 0.19/0.63 %-------------------------------------------
% 0.19/0.63 %--------------------------------------------------------------------------
% 0.19/0.63 % File : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.19/0.63 % Domain : Software Verification
% 0.19/0.63 % Problem : A condition from Hoare's FIND program
% 0.19/0.63 % Version : Especial.
% 0.19/0.63 % English :
% 0.19/0.63
% 0.19/0.63 % Refs : [Ble77] Bledsoe (1977), Non-resolution Theorem Proving
% 0.19/0.63 % : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format
% 0.19/0.63 % Source : [Pla82]
% 0.19/0.63 % Names : Hoares FIND [Ble77]
% 0.19/0.63 % : Problem 5.5 [Pla82]
% 0.19/0.63
% 0.19/0.63 % Status : Unsatisfiable
% 0.19/0.63 % Rating : 0.00 v2.0.0
% 0.19/0.63 % Syntax : Number of clauses : 9 ( 5 unt; 1 nHn; 8 RR)
% 0.19/0.63 % Number of literals : 20 ( 0 equ; 11 neg)
% 0.19/0.63 % Maximal clause size : 5 ( 2 avg)
% 0.19/0.63 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.63 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.19/0.63 % Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% 0.19/0.63 % Number of variables : 8 ( 0 sgn)
% 0.19/0.63 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.63
% 0.19/0.63 % Comments :
% 0.19/0.63 %--------------------------------------------------------------------------
% 0.19/0.63 cnf(clause_1,negated_conjecture,
% 0.19/0.63 ( less_or_equal(X,Y)
% 0.19/0.63 | less(Y,X) ) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_2,negated_conjecture,
% 0.19/0.63 less(j,i) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_3,negated_conjecture,
% 0.19/0.63 less_or_equal(m,p) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_4,negated_conjecture,
% 0.19/0.63 less_or_equal(p,q) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_5,negated_conjecture,
% 0.19/0.63 less_or_equal(q,n) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_6,negated_conjecture,
% 0.19/0.63 ( ~ less_or_equal(m,X)
% 0.19/0.63 | ~ less(X,i)
% 0.19/0.63 | ~ less(j,Y)
% 0.19/0.63 | ~ less_or_equal(Y,n)
% 0.19/0.63 | less_or_equal(a(X),a(Y)) ) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_7,negated_conjecture,
% 0.19/0.63 ( ~ less_or_equal(m,X)
% 0.19/0.63 | ~ less_or_equal(X,Y)
% 0.19/0.63 | ~ less_or_equal(Y,j)
% 0.19/0.63 | less_or_equal(a(X),a(Y)) ) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_8,negated_conjecture,
% 0.19/0.63 ( ~ less_or_equal(i,X)
% 0.19/0.63 | ~ less_or_equal(X,Y)
% 0.19/0.63 | ~ less_or_equal(Y,n)
% 0.19/0.63 | less_or_equal(a(X),a(Y)) ) ).
% 0.19/0.63
% 0.19/0.63 cnf(clause_9,negated_conjecture,
% 0.19/0.63 ~ less_or_equal(a(p),a(q)) ).
% 0.19/0.63
% 0.19/0.63 %--------------------------------------------------------------------------
% 0.19/0.63 %-------------------------------------------
% 0.19/0.63 % Proof found
% 0.19/0.63 % SZS status Theorem for theBenchmark
% 0.19/0.63 % SZS output start Proof
% 0.19/0.63 %ClaNum:9(EqnAxiom:0)
% 0.19/0.63 %VarNum:22(SingletonVarNum:8)
% 0.19/0.63 %MaxLitNum:5
% 0.19/0.63 %MaxfuncDepth:1
% 0.19/0.63 %SharedTerms:13
% 0.19/0.63 %goalClause: 1 2 3 4 5 6 7 8 9
% 0.19/0.63 %singleGoalClaCount:5
% 0.19/0.63 [1]P1(a1,a5)
% 0.19/0.63 [2]P1(a5,a7)
% 0.19/0.63 [3]P1(a7,a6)
% 0.19/0.63 [4]P2(a2,a3)
% 0.19/0.63 [5]~P1(f4(a5),f4(a7))
% 0.19/0.63 [6]P2(x62,x61)+P1(x61,x62)
% 0.19/0.63 [7]~P1(x71,x72)+~P1(x72,a2)+~P1(a1,x71)+P1(f4(x71),f4(x72))
% 0.19/0.63 [8]~P1(x81,x82)+~P1(x82,a6)+~P1(a3,x81)+P1(f4(x81),f4(x82))
% 0.19/0.63 [9]~P1(x92,a6)+~P2(x91,a3)+~P1(a1,x91)+~P2(a2,x92)+P1(f4(x91),f4(x92))
% 0.19/0.63 %EqnAxiom
% 0.19/0.63
% 0.19/0.63 %-------------------------------------------
% 0.19/0.64 cnf(11,plain,
% 0.19/0.64 (~P1(a3,a5)),
% 0.19/0.64 inference(scs_inference,[],[2,3,5,6,8])).
% 0.19/0.64 cnf(12,plain,
% 0.19/0.64 (~P1(a7,a2)),
% 0.19/0.64 inference(scs_inference,[],[1,2,3,5,6,8,7])).
% 0.19/0.64 cnf(20,plain,
% 0.19/0.64 (~P2(a5,a3)),
% 0.19/0.64 inference(scs_inference,[],[3,12,5,1,6,9])).
% 0.19/0.64 cnf(23,plain,
% 0.19/0.64 ($false),
% 0.19/0.64 inference(scs_inference,[],[11,20,6]),
% 0.19/0.64 ['proof']).
% 0.19/0.64 % SZS output end Proof
% 0.19/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------