TSTP Solution File: SYN066+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n029.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:59 EDT 2023
% Result : Theorem 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n029.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 22:11:55 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% 0.20/0.63 % Domain : Syntactic
% 0.20/0.63 % Problem : Pelletier Problem 37
% 0.20/0.63 % Version : Especial.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.20/0.63 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.63 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.63 % Source : [Hah94]
% 0.20/0.63 % Names : Pelletier 37 [Pel86]
% 0.20/0.63
% 0.20/0.63 % Status : Theorem
% 0.20/0.63 % Rating : 0.07 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.00 v6.4.0, 0.07 v6.3.0, 0.15 v6.2.0, 0.09 v6.1.0, 0.04 v6.0.0, 0.00 v5.5.0, 0.04 v5.4.0, 0.09 v5.3.0, 0.13 v5.2.0, 0.00 v4.0.1, 0.05 v3.7.0, 0.00 v3.2.0, 0.11 v3.1.0
% 0.20/0.63 % Syntax : Number of formulae : 4 ( 1 unt; 0 def)
% 0.20/0.63 % Number of atoms : 10 ( 0 equ)
% 0.20/0.63 % Maximal formula atoms : 5 ( 2 avg)
% 0.20/0.63 % Number of connectives : 7 ( 1 ~; 0 |; 2 &)
% 0.20/0.63 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.20/0.63 % Maximal formula depth : 9 ( 5 avg)
% 0.20/0.63 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.63 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty)
% 0.20/0.63 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.63 % Number of variables : 13 ( 6 !; 7 ?)
% 0.20/0.63 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.63
% 0.20/0.63 % Comments :
% 0.20/0.63 % Bugfixes : Fixed pel37_1.
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 fof(pel37_1,axiom,
% 0.20/0.63 ! [Z] :
% 0.20/0.63 ? [W] :
% 0.20/0.63 ! [X] :
% 0.20/0.63 ? [Y] :
% 0.20/0.63 ( ( big_p(X,Z)
% 0.20/0.63 => big_p(Y,W) )
% 0.20/0.63 & big_p(Y,Z)
% 0.20/0.63 & ( big_p(Y,W)
% 0.20/0.63 => ? [U] : big_q(U,W) ) ) ).
% 0.20/0.63
% 0.20/0.63 fof(pel37_2,axiom,
% 0.20/0.63 ! [X,Z] :
% 0.20/0.63 ( ~ big_p(X,Z)
% 0.20/0.63 => ? [Y] : big_q(Y,Z) ) ).
% 0.20/0.63
% 0.20/0.63 fof(pel37_3,axiom,
% 0.20/0.63 ( ? [X,Y] : big_q(X,Y)
% 0.20/0.63 => ! [Z] : big_r(Z,Z) ) ).
% 0.20/0.63
% 0.20/0.63 fof(pel37,conjecture,
% 0.20/0.63 ! [X] :
% 0.20/0.63 ? [Y] : big_r(X,Y) ).
% 0.20/0.63
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:6(EqnAxiom:0)
% 0.20/0.63 %VarNum:24(SingletonVarNum:12)
% 0.20/0.63 %MaxLitNum:2
% 0.20/0.63 %MaxfuncDepth:1
% 0.20/0.63 %SharedTerms:1
% 0.20/0.63 %goalClause: 2
% 0.20/0.63 %singleGoalClaCount:1
% 0.20/0.63 [2]~P2(a3,x21)
% 0.20/0.63 [1]P1(f1(x11,x12),x11)
% 0.20/0.63 [4]P1(x41,x42)+P3(f4(x41,x42),x42)
% 0.20/0.63 [5]~P1(x52,x51)+P1(f1(x51,x52),f2(x51))
% 0.20/0.63 [6]~P1(f1(x61,x62),f2(x61))+P3(f5(x61,x62),f2(x61))
% 0.20/0.63 [3]P2(x31,x31)+~P3(x32,x33)
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 cnf(7,plain,
% 0.20/0.64 (~P3(x71,x72)),
% 0.20/0.64 inference(scs_inference,[],[2,3])).
% 0.20/0.64 cnf(9,plain,
% 0.20/0.64 (P3(f5(x91,x92),f2(x91))),
% 0.20/0.64 inference(scs_inference,[],[2,3,4,6])).
% 0.20/0.64 cnf(10,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[7,9]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------