TSTP Solution File: SYN058-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN058-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 : n013.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 : Fri Sep 1 01:43:55 EDT 2023
% Result : Unsatisfiable 0.21s 0.62s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN058-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n013.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 : Sat Aug 26 17:16:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.58 start to proof:theBenchmark
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 % File :CSE---1.6
% 0.21/0.62 % Problem :theBenchmark
% 0.21/0.62 % Transform :cnf
% 0.21/0.62 % Format :tptp:raw
% 0.21/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.62
% 0.21/0.62 % Result :Theorem 0.000000s
% 0.21/0.62 % Output :CNFRefutation 0.000000s
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 %--------------------------------------------------------------------------
% 0.21/0.62 % File : SYN058-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.62 % Domain : Syntactic
% 0.21/0.62 % Problem : Pelletier Problem 28
% 0.21/0.62 % Version : Especial.
% 0.21/0.62 % English :
% 0.21/0.62
% 0.21/0.62 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.21/0.62 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.21/0.62 % : [Pel88] Pelletier (1988), Errata
% 0.21/0.62 % Source : [Pel86]
% 0.21/0.62 % Names : Pelletier 28 [Pel86]
% 0.21/0.62
% 0.21/0.62 % Status : Unsatisfiable
% 0.21/0.62 % Rating : 0.00 v2.0.0
% 0.21/0.62 % Syntax : Number of clauses : 9 ( 3 unt; 0 nHn; 8 RR)
% 0.21/0.62 % Number of literals : 16 ( 0 equ; 8 neg)
% 0.21/0.62 % Maximal clause size : 3 ( 1 avg)
% 0.21/0.62 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.62 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% 0.21/0.62 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% 0.21/0.62 % Number of variables : 4 ( 3 sgn)
% 0.21/0.62 % SPC : CNF_UNS_EPR_NEQ_HRN
% 0.21/0.62
% 0.21/0.62 % Comments : This problem is incorrect in [Pel86] and is corrected in [Pel88].
% 0.21/0.62 %--------------------------------------------------------------------------
% 0.21/0.62 cnf(clause_1,axiom,
% 0.21/0.62 ( ~ big_p(X)
% 0.21/0.62 | big_q(Y) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_2,axiom,
% 0.21/0.62 ( ~ big_q(b)
% 0.21/0.62 | big_q(c) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_3,axiom,
% 0.21/0.62 ( ~ big_q(b)
% 0.21/0.62 | big_s(c) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_4,axiom,
% 0.21/0.62 ( ~ big_r(b)
% 0.21/0.62 | big_q(c) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_5,axiom,
% 0.21/0.62 ( ~ big_r(b)
% 0.21/0.62 | big_s(c) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_6,axiom,
% 0.21/0.62 ( ~ big_s(Y)
% 0.21/0.62 | ~ big_f(X)
% 0.21/0.62 | big_g(X) ) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_7,negated_conjecture,
% 0.21/0.62 big_p(d) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_8,negated_conjecture,
% 0.21/0.62 big_f(d) ).
% 0.21/0.62
% 0.21/0.62 cnf(clause_9,negated_conjecture,
% 0.21/0.62 ~ big_g(d) ).
% 0.21/0.62
% 0.21/0.62 %--------------------------------------------------------------------------
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 % Proof found
% 0.21/0.62 % SZS status Theorem for theBenchmark
% 0.21/0.62 % SZS output start Proof
% 0.21/0.62 %ClaNum:9(EqnAxiom:0)
% 0.21/0.62 %VarNum:5(SingletonVarNum:4)
% 0.21/0.62 %MaxLitNum:3
% 0.21/0.62 %MaxfuncDepth:0
% 0.21/0.62 %SharedTerms:10
% 0.21/0.62 %goalClause: 1 2 3
% 0.21/0.62 %singleGoalClaCount:3
% 0.21/0.62 [1]P1(a1)
% 0.21/0.62 [2]P2(a1)
% 0.21/0.62 [3]~P3(a1)
% 0.21/0.62 [4]P4(a2)+~P4(a3)
% 0.21/0.62 [5]P4(a2)+~P5(a3)
% 0.21/0.62 [6]P6(a2)+~P4(a3)
% 0.21/0.62 [7]P6(a2)+~P5(a3)
% 0.21/0.62 [8]P4(x81)+~P1(x82)
% 0.21/0.62 [9]~P2(x91)+P3(x91)+~P6(x92)
% 0.21/0.62 %EqnAxiom
% 0.21/0.62
% 0.21/0.62 %-------------------------------------------
% 0.21/0.62 cnf(12,plain,
% 0.21/0.62 ($false),
% 0.21/0.62 inference(scs_inference,[],[1,2,3,9,8,6]),
% 0.21/0.62 ['proof']).
% 0.21/0.62 % SZS output end Proof
% 0.21/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------