TSTP Solution File: KRS017-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : KRS017-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 : n024.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:39:00 EDT 2023
% Result : Unsatisfiable 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS017-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33 % Computer : n024.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 : Mon Aug 28 01:50:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % File :CSE---1.6
% 0.19/0.60 % Problem :theBenchmark
% 0.19/0.60 % Transform :cnf
% 0.19/0.60 % Format :tptp:raw
% 0.19/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.60
% 0.19/0.60 % Result :Theorem 0.000000s
% 0.19/0.60 % Output :CNFRefutation 0.000000s
% 0.19/0.60 %-------------------------------------------
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 % File : KRS017-1 : TPTP v8.1.2. Released v2.0.0.
% 0.19/0.61 % Domain : Knowledge Representation
% 0.19/0.61 % Problem : Paramasivam problem T-Box 7a
% 0.19/0.61 % Version : Especial.
% 0.19/0.61 % English : a subsumes e.
% 0.19/0.61
% 0.19/0.61 % Refs : [PP95] Paramasivam & Plaisted (1995), Automated Deduction Tec
% 0.19/0.61 % Source : [PP95]
% 0.19/0.61 % Names : Problem 7(a) [PP95]
% 0.19/0.61
% 0.19/0.61 % Status : Unsatisfiable
% 0.19/0.61 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v2.1.0
% 0.19/0.61 % Syntax : Number of clauses : 7 ( 2 unt; 2 nHn; 7 RR)
% 0.19/0.61 % Number of literals : 17 ( 0 equ; 9 neg)
% 0.19/0.61 % Maximal clause size : 4 ( 2 avg)
% 0.19/0.61 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.61 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty)
% 0.19/0.61 % Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% 0.19/0.61 % Number of variables : 10 ( 3 sgn)
% 0.19/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.61
% 0.19/0.61 % Comments :
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 cnf(clause_1,negated_conjecture,
% 0.19/0.61 e(exists) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_2,negated_conjecture,
% 0.19/0.61 ~ a(exists) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_3,axiom,
% 0.19/0.61 ( r(X1,u0r3(X1))
% 0.19/0.61 | ~ e(X1) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_4,axiom,
% 0.19/0.61 ( a(X3)
% 0.19/0.61 | ~ e(X1)
% 0.19/0.61 | ~ r(X1,X2)
% 0.19/0.61 | ~ r(X3,X2) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_5,axiom,
% 0.19/0.61 ( e(X1)
% 0.19/0.61 | ~ a(u0r2(X1))
% 0.19/0.61 | ~ r(X1,X4) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_6,axiom,
% 0.19/0.61 ( e(X1)
% 0.19/0.61 | r(u0r2(X1),u0r1(X1))
% 0.19/0.61 | ~ r(X1,X4) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(clause_7,axiom,
% 0.19/0.61 ( e(X1)
% 0.19/0.61 | r(X1,u0r1(X1))
% 0.19/0.61 | ~ r(X1,X4) ) ).
% 0.19/0.61
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark
% 0.19/0.61 % SZS output start Proof
% 0.19/0.61 %ClaNum:7(EqnAxiom:0)
% 0.19/0.61 %VarNum:23(SingletonVarNum:10)
% 0.19/0.61 %MaxLitNum:4
% 0.19/0.61 %MaxfuncDepth:1
% 0.19/0.61 %SharedTerms:3
% 0.19/0.61 %goalClause: 1 2
% 0.19/0.61 %singleGoalClaCount:2
% 0.19/0.61 [1]P1(a1)
% 0.19/0.61 [2]~P2(a1)
% 0.19/0.61 [3]~P1(x31)+P3(x31,f2(x31))
% 0.19/0.61 [4]P1(x41)+~P3(x41,x42)+~P2(f3(x41))
% 0.19/0.61 [5]P1(x51)+~P3(x51,x52)+P3(x51,f4(x51))
% 0.19/0.61 [6]P1(x61)+~P3(x61,x62)+P3(f3(x61),f4(x61))
% 0.19/0.61 [7]~P3(x71,x73)+P2(x71)+~P3(x72,x73)+~P1(x72)
% 0.19/0.61 %EqnAxiom
% 0.19/0.61
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 cnf(9,plain,
% 0.19/0.61 ($false),
% 0.19/0.61 inference(scs_inference,[],[1,2,7,3]),
% 0.19/0.61 ['proof']).
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------