TSTP Solution File: KRS003-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n027.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 05:38:58 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 02:43:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.52 start to proof:theBenchmark
% 0.19/0.57 %-------------------------------------------
% 0.19/0.57 % File :CSE---1.6
% 0.19/0.57 % Problem :theBenchmark
% 0.19/0.57 % Transform :cnf
% 0.19/0.57 % Format :tptp:raw
% 0.19/0.57 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.57
% 0.19/0.57 % Result :Theorem 0.000000s
% 0.19/0.57 % Output :CNFRefutation 0.000000s
% 0.19/0.57 %-------------------------------------------
% 0.19/0.57 %--------------------------------------------------------------------------
% 0.19/0.57 % File : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% 0.19/0.57 % Domain : Knowledge Representation
% 0.19/0.57 % Problem : Paramasivam problem T-Box 1c
% 0.19/0.57 % Version : Especial.
% 0.19/0.57 % English : e and f exist.
% 0.19/0.57
% 0.19/0.57 % Refs : [PP95] Paramasivam & Plaisted (1995), Automated Deduction Tec
% 0.19/0.57 % Source : [PP95]
% 0.19/0.57 % Names : Problem 1(c) [PP95]
% 0.19/0.57
% 0.19/0.57 % Status : Unsatisfiable
% 0.19/0.57 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v2.1.0
% 0.19/0.57 % Syntax : Number of clauses : 16 ( 2 unt; 3 nHn; 14 RR)
% 0.19/0.57 % Number of literals : 34 ( 0 equ; 16 neg)
% 0.19/0.57 % Maximal clause size : 4 ( 2 avg)
% 0.19/0.57 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.57 % Number of predicates : 8 ( 8 usr; 0 prp; 1-2 aty)
% 0.19/0.57 % Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% 0.19/0.57 % Number of variables : 18 ( 0 sgn)
% 0.19/0.57 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.57
% 0.19/0.57 % Comments :
% 0.19/0.57 %--------------------------------------------------------------------------
% 0.19/0.57 cnf(clause_1,negated_conjecture,
% 0.19/0.57 e(exist) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_2,negated_conjecture,
% 0.19/0.57 f(exist) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_3,axiom,
% 0.19/0.57 ( s2least(X1)
% 0.19/0.57 | ~ c(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_4,axiom,
% 0.19/0.57 ( c(X1)
% 0.19/0.57 | ~ s2least(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_5,axiom,
% 0.19/0.57 ( ~ s2least(X1)
% 0.19/0.57 | ~ equalish(u1r2(X1),u1r1(X1)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_6,axiom,
% 0.19/0.57 ( s(X1,u1r1(X1))
% 0.19/0.57 | ~ s2least(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_7,axiom,
% 0.19/0.57 ( s(X1,u1r2(X1))
% 0.19/0.57 | ~ s2least(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_8,axiom,
% 0.19/0.57 ( s2least(X1)
% 0.19/0.57 | equalish(X3,X2)
% 0.19/0.57 | ~ s(X1,X3)
% 0.19/0.57 | ~ s(X1,X2) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_9,axiom,
% 0.19/0.57 ( s1most(X1)
% 0.19/0.57 | ~ d(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_10,axiom,
% 0.19/0.57 ( d(X1)
% 0.19/0.57 | ~ s1most(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_11,axiom,
% 0.19/0.57 ( equalish(X3,X2)
% 0.19/0.57 | ~ s1most(X1)
% 0.19/0.57 | ~ s(X1,X3)
% 0.19/0.57 | ~ s(X1,X2) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_12,axiom,
% 0.19/0.57 ( s1most(X1)
% 0.19/0.57 | ~ equalish(u3r2(X1),u3r1(X1)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_13,axiom,
% 0.19/0.57 ( s1most(X1)
% 0.19/0.57 | s(X1,u3r1(X1)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_14,axiom,
% 0.19/0.57 ( s1most(X1)
% 0.19/0.57 | s(X1,u3r2(X1)) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_15,axiom,
% 0.19/0.57 ( c(X1)
% 0.19/0.57 | ~ e(X1) ) ).
% 0.19/0.57
% 0.19/0.57 cnf(clause_16,axiom,
% 0.19/0.57 ( d(X1)
% 0.19/0.57 | ~ f(X1) ) ).
% 0.19/0.57
% 0.19/0.57 %--------------------------------------------------------------------------
% 0.19/0.57 %-------------------------------------------
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof
% 0.19/0.57 %ClaNum:16(EqnAxiom:0)
% 0.19/0.57 %VarNum:44(SingletonVarNum:18)
% 0.19/0.57 %MaxLitNum:4
% 0.19/0.57 %MaxfuncDepth:1
% 0.19/0.57 %SharedTerms:3
% 0.19/0.58 %goalClause: 1 2
% 0.19/0.58 %singleGoalClaCount:2
% 0.19/0.58 [1]P1(a1)
% 0.19/0.58 [2]P4(a1)
% 0.19/0.58 [3]~P2(x31)+P6(x31)
% 0.19/0.58 [4]~P1(x41)+P2(x41)
% 0.19/0.58 [5]~P6(x51)+P2(x51)
% 0.19/0.58 [6]~P3(x61)+P7(x61)
% 0.19/0.58 [7]~P4(x71)+P3(x71)
% 0.19/0.58 [8]~P7(x81)+P3(x81)
% 0.19/0.58 [9]P7(x91)+P8(x91,f2(x91))
% 0.19/0.58 [10]P7(x101)+P8(x101,f3(x101))
% 0.19/0.58 [11]~P6(x111)+P8(x111,f4(x111))
% 0.19/0.58 [12]~P6(x121)+P8(x121,f5(x121))
% 0.19/0.58 [13]P7(x131)+~P5(f2(x131),f3(x131))
% 0.19/0.58 [14]~P6(x141)+~P5(f4(x141),f5(x141))
% 0.19/0.58 [15]~P8(x151,x153)+~P8(x151,x152)+P6(x151)+P5(x152,x153)
% 0.19/0.58 [16]~P8(x163,x162)+~P8(x163,x161)+P5(x161,x162)+~P7(x163)
% 0.19/0.58 %EqnAxiom
% 0.19/0.58
% 0.19/0.58 %-------------------------------------------
% 0.19/0.58 cnf(18,plain,
% 0.19/0.58 (P7(a1)),
% 0.19/0.58 inference(scs_inference,[],[2,7,6])).
% 0.19/0.58 cnf(23,plain,
% 0.19/0.58 (P8(a1,f5(a1))),
% 0.19/0.58 inference(scs_inference,[],[1,2,7,6,4,3,12])).
% 0.19/0.58 cnf(25,plain,
% 0.19/0.58 (P8(a1,f4(a1))),
% 0.19/0.58 inference(scs_inference,[],[1,2,7,6,4,3,12,11])).
% 0.19/0.58 cnf(27,plain,
% 0.19/0.58 (~P5(f4(a1),f5(a1))),
% 0.19/0.58 inference(scs_inference,[],[1,2,7,6,4,3,12,11,14])).
% 0.19/0.58 cnf(33,plain,
% 0.19/0.58 ($false),
% 0.19/0.58 inference(scs_inference,[],[27,25,23,18,16]),
% 0.19/0.58 ['proof']).
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time :0.000000s
%------------------------------------------------------------------------------