TSTP Solution File: SYN062+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN062+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 : n022.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:57 EDT 2023
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 18:39:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.53 start to proof:theBenchmark
% 0.21/0.58 %-------------------------------------------
% 0.21/0.58 % File :CSE---1.6
% 0.21/0.58 % Problem :theBenchmark
% 0.21/0.58 % Transform :cnf
% 0.21/0.58 % Format :tptp:raw
% 0.21/0.58 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.58
% 0.21/0.58 % Result :Theorem 0.000000s
% 0.21/0.58 % Output :CNFRefutation 0.000000s
% 0.21/0.58 %-------------------------------------------
% 0.21/0.58 %--------------------------------------------------------------------------
% 0.21/0.58 % File : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% 0.21/0.58 % Domain : Syntactic
% 0.21/0.58 % Problem : Pelletier Problem 32
% 0.21/0.58 % Version : Especial.
% 0.21/0.58 % English :
% 0.21/0.58
% 0.21/0.58 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.21/0.58 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.21/0.58 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.21/0.58 % Source : [Hah94]
% 0.21/0.58 % Names : Pelletier 32 [Pel86]
% 0.21/0.58
% 0.21/0.58 % Status : Theorem
% 0.21/0.58 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0
% 0.21/0.58 % Syntax : Number of formulae : 4 ( 0 unt; 0 def)
% 0.21/0.58 % Number of atoms : 12 ( 0 equ)
% 0.21/0.58 % Maximal formula atoms : 4 ( 3 avg)
% 0.21/0.58 % Number of connectives : 8 ( 0 ~; 1 |; 3 &)
% 0.21/0.58 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.21/0.58 % Maximal formula depth : 5 ( 4 avg)
% 0.21/0.58 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.58 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% 0.21/0.58 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.21/0.58 % Number of variables : 4 ( 4 !; 0 ?)
% 0.21/0.58 % SPC : FOF_THM_EPR_NEQ
% 0.21/0.58
% 0.21/0.58 % Comments :
% 0.21/0.58 %--------------------------------------------------------------------------
% 0.21/0.58 fof(pel32_1,axiom,
% 0.21/0.58 ! [X] :
% 0.21/0.58 ( ( big_f(X)
% 0.21/0.58 & ( big_g(X)
% 0.21/0.58 | big_h(X) ) )
% 0.21/0.59 => big_i(X) ) ).
% 0.21/0.59
% 0.21/0.59 fof(pel32_2,axiom,
% 0.21/0.59 ! [X] :
% 0.21/0.59 ( ( big_i(X)
% 0.21/0.59 & big_h(X) )
% 0.21/0.59 => big_j(X) ) ).
% 0.21/0.59
% 0.21/0.59 fof(pel32_3,axiom,
% 0.21/0.59 ! [X] :
% 0.21/0.59 ( big_k(X)
% 0.21/0.59 => big_h(X) ) ).
% 0.21/0.59
% 0.21/0.59 fof(pel32,conjecture,
% 0.21/0.59 ! [X] :
% 0.21/0.59 ( ( big_f(X)
% 0.21/0.59 & big_k(X) )
% 0.21/0.59 => big_j(X) ) ).
% 0.21/0.59
% 0.21/0.59 %--------------------------------------------------------------------------
% 0.21/0.59 %-------------------------------------------
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark
% 0.21/0.59 % SZS output start Proof
% 0.21/0.59 %ClaNum:7(EqnAxiom:0)
% 0.21/0.59 %VarNum:11(SingletonVarNum:4)
% 0.21/0.59 %MaxLitNum:3
% 0.21/0.59 %MaxfuncDepth:0
% 0.21/0.59 %SharedTerms:4
% 0.21/0.59 %goalClause: 1 2 3
% 0.21/0.59 %singleGoalClaCount:3
% 0.21/0.59 [1]P1(a1)
% 0.21/0.59 [2]P2(a1)
% 0.21/0.59 [3]~P3(a1)
% 0.21/0.59 [4]~P2(x41)+P4(x41)
% 0.21/0.59 [5]~P1(x51)+~P5(x51)+P6(x51)
% 0.21/0.59 [6]~P1(x61)+~P4(x61)+P6(x61)
% 0.21/0.59 [7]~P4(x71)+~P6(x71)+P3(x71)
% 0.21/0.59 %EqnAxiom
% 0.21/0.59
% 0.21/0.59 %-------------------------------------------
% 0.21/0.59 cnf(10,plain,
% 0.21/0.59 ($false),
% 0.21/0.59 inference(scs_inference,[],[1,2,3,4,7,6]),
% 0.21/0.59 ['proof']).
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time :0.000000s
%------------------------------------------------------------------------------