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