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 v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/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 : Fri Sep 1 01:43:55 EDT 2023
% Result : Theorem 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 20:59:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % File :CSE---1.6
% 0.20/0.62 % Problem :theBenchmark
% 0.20/0.62 % Transform :cnf
% 0.20/0.62 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.000000s
% 0.20/0.62 % Output :CNFRefutation 0.000000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 % File : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.62 % Domain : Syntactic
% 0.20/0.62 % Problem : Pelletier Problem 28
% 0.20/0.62 % Version : Especial.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.20/0.62 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.62 % : [Pel88] Pelletier (1988), Errata
% 0.20/0.62 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Hah94]
% 0.20/0.62 % Names : Pelletier 28 [Pel86]
% 0.20/0.62
% 0.20/0.62 % Status : Theorem
% 0.20/0.62 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.20/0.62 % Syntax : Number of formulae : 4 ( 0 unt; 0 def)
% 0.20/0.62 % Number of atoms : 12 ( 0 equ)
% 0.20/0.62 % Maximal formula atoms : 4 ( 3 avg)
% 0.20/0.62 % Number of connectives : 8 ( 0 ~; 1 |; 2 &)
% 0.20/0.62 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.20/0.62 % Maximal formula depth : 4 ( 4 avg)
% 0.20/0.62 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.62 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% 0.20/0.62 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.62 % Number of variables : 7 ( 5 !; 2 ?)
% 0.20/0.62 % SPC : FOF_THM_EPR_NEQ
% 0.20/0.62
% 0.20/0.62 % Comments : This problem is incorrect in [Pel86] and is corrected in [Pel88].
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 fof(pel28_1,axiom,
% 0.20/0.62 ! [X] :
% 0.20/0.62 ( big_p(X)
% 0.20/0.62 => ! [Z] : big_q(Z) ) ).
% 0.20/0.62
% 0.20/0.62 fof(pel28_2,axiom,
% 0.20/0.62 ( ! [X] :
% 0.20/0.62 ( big_q(X)
% 0.20/0.62 | big_r(X) )
% 0.20/0.62 => ? [X1] :
% 0.20/0.62 ( big_q(X1)
% 0.20/0.62 & big_s(X1) ) ) ).
% 0.20/0.62
% 0.20/0.62 fof(pel28_3,axiom,
% 0.20/0.62 ( ? [X] : big_s(X)
% 0.20/0.62 => ! [X1] :
% 0.20/0.62 ( big_f(X1)
% 0.20/0.62 => big_g(X1) ) ) ).
% 0.20/0.62
% 0.20/0.62 fof(pel28,conjecture,
% 0.20/0.62 ! [X] :
% 0.20/0.62 ( ( big_p(X)
% 0.20/0.62 & big_f(X) )
% 0.20/0.62 => big_g(X) ) ).
% 0.20/0.62
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.63 %ClaNum:9(EqnAxiom:0)
% 0.20/0.63 %VarNum:5(SingletonVarNum:4)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:0
% 0.20/0.63 %SharedTerms:10
% 0.20/0.63 %goalClause: 1 2 3
% 0.20/0.63 %singleGoalClaCount:3
% 0.20/0.63 [1]P1(a1)
% 0.20/0.63 [2]P2(a1)
% 0.20/0.63 [3]~P3(a1)
% 0.20/0.63 [4]P4(a2)+~P4(a3)
% 0.20/0.63 [5]P4(a2)+~P5(a3)
% 0.20/0.63 [6]P6(a2)+~P4(a3)
% 0.20/0.63 [7]P6(a2)+~P5(a3)
% 0.20/0.63 [8]P4(x81)+~P1(x82)
% 0.20/0.63 [9]~P2(x91)+P3(x91)+~P6(x92)
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 cnf(12,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[1,2,3,9,8,6]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------