TSTP Solution File: SWV001-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n023.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:31 EDT 2023
% Result : Unsatisfiable 0.48s 0.62s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 04:50:25 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.48/0.55 start to proof:theBenchmark
% 0.48/0.61 %-------------------------------------------
% 0.48/0.61 % File :CSE---1.6
% 0.48/0.61 % Problem :theBenchmark
% 0.48/0.61 % Transform :cnf
% 0.48/0.61 % Format :tptp:raw
% 0.48/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.48/0.61
% 0.48/0.61 % Result :Theorem 0.010000s
% 0.48/0.61 % Output :CNFRefutation 0.010000s
% 0.48/0.61 %-------------------------------------------
% 0.48/0.61 %--------------------------------------------------------------------------
% 0.48/0.61 % File : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.48/0.61 % Domain : Software Verification
% 0.48/0.61 % Problem : PV1
% 0.48/0.61 % Version : Especial.
% 0.48/0.61 % English : These "clauses arose in a natural manner from work done in
% 0.48/0.61 % program verification" [MOW76] p.779.
% 0.48/0.61
% 0.48/0.61 % Refs : [MOW76] McCharen et al. (1976), Problems and Experiments for a
% 0.48/0.61 % Source : [MOW76]
% 0.48/0.61 % Names : PV1 [MOW76]
% 0.48/0.61
% 0.48/0.61 % Status : Unsatisfiable
% 0.48/0.61 % Rating : 0.00 v2.0.0
% 0.48/0.61 % Syntax : Number of clauses : 14 ( 2 unt; 2 nHn; 12 RR)
% 0.48/0.61 % Number of literals : 36 ( 0 equ; 22 neg)
% 0.48/0.61 % Maximal clause size : 4 ( 2 avg)
% 0.48/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.48/0.61 % Number of predicates : 6 ( 6 usr; 0 prp; 2-3 aty)
% 0.48/0.61 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% 0.48/0.61 % Number of variables : 30 ( 2 sgn)
% 0.48/0.61 % SPC : CNF_UNS_EPR_NEQ_NHN
% 0.48/0.61
% 0.48/0.61 % Comments : This problem was contributed to [MOW76] by E. McCharen. The
% 0.48/0.61 % axioms are incomplete.
% 0.48/0.61 %--------------------------------------------------------------------------
% 0.48/0.61 cnf(less_or_equal_substitution1,axiom,
% 0.48/0.61 ( ~ equalish(X,Y)
% 0.48/0.61 | ~ less_or_equalish(X,Z)
% 0.48/0.61 | less_or_equalish(Y,Z) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(less_or_equal_substitution2,axiom,
% 0.48/0.61 ( ~ equalish(X,Y)
% 0.48/0.61 | ~ less_or_equalish(Z,X)
% 0.48/0.61 | less_or_equalish(Z,Y) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(clause_1,axiom,
% 0.48/0.61 ( ~ q1(X,Y,Z)
% 0.48/0.61 | ~ less_or_equalish(X,Y)
% 0.48/0.61 | q2(X,Y,Z) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(clause_2,axiom,
% 0.48/0.61 ( ~ q1(X,Y,Z)
% 0.48/0.61 | less_or_equalish(X,Y)
% 0.48/0.61 | q3(X,Y,Z) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(clause_3,axiom,
% 0.48/0.61 ( ~ q2(X,Y,Z)
% 0.48/0.61 | q4(X,Y,Y) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(clause_4,axiom,
% 0.48/0.61 ( ~ q3(X,Y,Z)
% 0.48/0.61 | q4(X,Y,X) ) ).
% 0.48/0.61
% 0.48/0.61 cnf(less_or_equal_reflexivity,axiom,
% 0.48/0.61 less_or_equalish(X,X) ).
% 0.48/0.61
% 0.48/0.61 cnf(less_or_equal_implies_equal,axiom,
% 0.48/0.61 ( ~ less_or_equalish(X,Y)
% 0.48/0.62 | ~ less_or_equalish(Y,X)
% 0.48/0.62 | equalish(X,Y) ) ).
% 0.48/0.62
% 0.48/0.62 cnf(transitivity_of_less_or_equal,axiom,
% 0.48/0.62 ( ~ less_or_equalish(X,Y)
% 0.48/0.62 | ~ less_or_equalish(Y,Z)
% 0.48/0.62 | less_or_equalish(X,Z) ) ).
% 0.48/0.62
% 0.48/0.62 cnf(all_less_or_equal,axiom,
% 0.48/0.62 ( less_or_equalish(X,Y)
% 0.48/0.62 | less_or_equalish(Y,X) ) ).
% 0.48/0.62
% 0.48/0.62 cnf(equal_implies_less_or_equal,axiom,
% 0.48/0.62 ( less_or_equalish(X,Y)
% 0.48/0.62 | ~ equalish(X,Y) ) ).
% 0.48/0.62
% 0.48/0.62 cnf(clause_5,negated_conjecture,
% 0.48/0.62 q1(a,b,c) ).
% 0.48/0.62
% 0.48/0.62 cnf(clause_6,negated_conjecture,
% 0.48/0.62 ( ~ q4(a,b,W)
% 0.48/0.62 | ~ less_or_equalish(a,W)
% 0.48/0.62 | ~ less_or_equalish(b,W)
% 0.48/0.62 | ~ less_or_equalish(W,a) ) ).
% 0.48/0.62
% 0.48/0.62 cnf(clause_7,negated_conjecture,
% 0.48/0.62 ( ~ q4(a,b,W)
% 0.48/0.62 | ~ less_or_equalish(a,W)
% 0.48/0.62 | ~ less_or_equalish(b,W)
% 0.48/0.62 | ~ less_or_equalish(W,b) ) ).
% 0.48/0.62
% 0.48/0.62 %--------------------------------------------------------------------------
% 0.48/0.62 %-------------------------------------------
% 0.48/0.62 % Proof found
% 0.48/0.62 % SZS status Theorem for theBenchmark
% 0.48/0.62 % SZS output start Proof
% 0.48/0.62 %ClaNum:14(EqnAxiom:0)
% 0.48/0.62 %VarNum:70(SingletonVarNum:30)
% 0.48/0.62 %MaxLitNum:4
% 0.48/0.62 %MaxfuncDepth:0
% 0.48/0.62 %SharedTerms:4
% 0.48/0.62 %goalClause: 2 11 12
% 0.48/0.62 %singleGoalClaCount:1
% 0.48/0.62 [2]P3(a1,a2,a3)
% 0.48/0.62 [1]P1(x11,x11)
% 0.48/0.62 [3]P1(x32,x31)+P1(x31,x32)
% 0.48/0.62 [4]~P2(x41,x42)+P1(x41,x42)
% 0.48/0.62 [9]P4(x91,x92,x92)+~P5(x91,x92,x93)
% 0.48/0.62 [10]P4(x101,x102,x101)+~P6(x101,x102,x103)
% 0.48/0.62 [5]~P1(x52,x51)+~P1(x51,x52)+P2(x51,x52)
% 0.48/0.62 [6]~P1(x61,x63)+P1(x61,x62)+~P2(x63,x62)
% 0.48/0.62 [7]~P1(x73,x72)+P1(x71,x72)+~P2(x73,x71)
% 0.48/0.62 [8]~P1(x81,x83)+P1(x81,x82)+~P1(x83,x82)
% 0.48/0.62 [13]~P3(x131,x132,x133)+P1(x131,x132)+P6(x131,x132,x133)
% 0.48/0.62 [14]~P1(x141,x142)+~P3(x141,x142,x143)+P5(x141,x142,x143)
% 0.48/0.62 [11]~P1(a1,x111)+~P1(a2,x111)+~P1(x111,a1)+~P4(a1,a2,x111)
% 0.48/0.62 [12]~P1(a1,x121)+~P1(a2,x121)+~P1(x121,a2)+~P4(a1,a2,x121)
% 0.48/0.62 %EqnAxiom
% 0.48/0.62
% 0.48/0.62 %-------------------------------------------
% 0.48/0.62 cnf(17,plain,
% 0.48/0.62 (P6(a1,a2,a3)+P1(a1,a2)),
% 0.48/0.62 inference(scs_inference,[],[2,1,5,14,13])).
% 0.48/0.62 cnf(19,plain,
% 0.48/0.62 (~P1(a1,a2)+~P4(a1,a2,a2)),
% 0.48/0.62 inference(scs_inference,[],[2,1,5,14,13,12])).
% 0.48/0.62 cnf(25,plain,
% 0.48/0.62 (P5(a1,a2,a3)+~P1(a1,a2)),
% 0.48/0.62 inference(scs_inference,[],[2,14])).
% 0.48/0.62 cnf(26,plain,
% 0.48/0.62 (P1(a2,a1)+~P4(a1,a2,a2)),
% 0.48/0.62 inference(scs_inference,[],[3,19])).
% 0.48/0.62 cnf(29,plain,
% 0.48/0.62 (P5(a1,a2,a3)+P6(a1,a2,a3)),
% 0.48/0.62 inference(scs_inference,[],[17,25])).
% 0.48/0.62 cnf(30,plain,
% 0.48/0.62 (~P5(a1,a2,x301)+P1(a2,a1)),
% 0.48/0.62 inference(scs_inference,[],[26,9])).
% 0.48/0.62 cnf(31,plain,
% 0.48/0.62 (P6(a1,a2,a3)+P1(a2,a1)),
% 0.48/0.62 inference(scs_inference,[],[30,29])).
% 0.48/0.62 cnf(32,plain,
% 0.48/0.62 (P4(a1,a2,a1)+P1(a2,a1)),
% 0.48/0.62 inference(scs_inference,[],[31,10])).
% 0.48/0.62 cnf(39,plain,
% 0.48/0.62 (P1(a1,a2)+~P1(a2,a1)),
% 0.48/0.62 inference(scs_inference,[],[2,1,11,32,10,13])).
% 0.48/0.62 cnf(41,plain,
% 0.48/0.62 (P1(a1,a2)),
% 0.48/0.62 inference(scs_inference,[],[39,3])).
% 0.48/0.62 cnf(42,plain,
% 0.48/0.62 (~P4(a1,a2,a2)),
% 0.48/0.62 inference(scs_inference,[],[41,19])).
% 0.48/0.62 cnf(43,plain,
% 0.48/0.62 (P5(a1,a2,a3)),
% 0.48/0.62 inference(scs_inference,[],[41,25])).
% 0.48/0.62 cnf(54,plain,
% 0.48/0.62 ($false),
% 0.48/0.62 inference(scs_inference,[],[42,43,9]),
% 0.48/0.62 ['proof']).
% 0.48/0.62 % SZS output end Proof
% 0.48/0.62 % Total time :0.010000s
%------------------------------------------------------------------------------