TSTP Solution File: SYN047+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN047+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 : n008.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:50 EDT 2023
% Result : Theorem 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 21:34:02 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 % File : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.61 % Domain : Syntactic
% 0.20/0.61 % Problem : Pelletier Problem 17
% 0.20/0.61 % Version : Especial.
% 0.20/0.61 % English : A problem which appears to not be provable by [BBH72].
% 0.20/0.61 % For details of why not, see [Pel82] p.135f.
% 0.20/0.61
% 0.20/0.61 % Refs : [BBH72] Bledsoe et al. (1972), Computer Proofs of Limit Theore
% 0.20/0.61 % : [Pel82] Pelletier (1982), Completely Non-clausal, Completely H
% 0.20/0.61 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.61 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.61 % Source : [Hah94]
% 0.20/0.61 % Names : Pelletier 17 [Pel86]
% 0.20/0.61
% 0.20/0.61 % Status : Theorem
% 0.20/0.61 % Rating : 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.61 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.20/0.61 % Number of atoms : 10 ( 0 equ)
% 0.20/0.61 % Maximal formula atoms : 10 ( 10 avg)
% 0.20/0.61 % Number of connectives : 12 ( 3 ~; 4 |; 2 &)
% 0.20/0.61 % ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% 0.20/0.61 % Maximal formula depth : 6 ( 6 avg)
% 0.20/0.61 % Maximal term depth : 0 ( 0 avg)
% 0.20/0.61 % Number of predicates : 4 ( 4 usr; 4 prp; 0-0 aty)
% 0.20/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.61 % Number of variables : 0 ( 0 !; 0 ?)
% 0.20/0.61 % SPC : FOF_THM_PRP
% 0.20/0.61
% 0.20/0.61 % Comments :
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 fof(pel17,conjecture,
% 0.20/0.61 ( ( ( p
% 0.20/0.61 & ( q
% 0.20/0.61 => r ) )
% 0.20/0.61 => s )
% 0.20/0.61 <=> ( ( ~ p
% 0.20/0.61 | q
% 0.20/0.61 | s )
% 0.20/0.61 & ( ~ p
% 0.20/0.61 | ~ r
% 0.20/0.61 | s ) ) ) ).
% 0.20/0.61
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:31(EqnAxiom:0)
% 0.20/0.61 %VarNum:0(SingletonVarNum:0)
% 0.20/0.61 %MaxLitNum:3
% 0.20/0.61 %MaxfuncDepth:0
% 0.20/0.61 %SharedTerms:9
% 0.20/0.61 %goalClause: 1 2 11 20 27
% 0.20/0.61 %singleGoalClaCount:2
% 0.20/0.61 [1]P1(a500)
% 0.20/0.61 [2]~P2(a500)
% 0.20/0.61 [11]P3(a500)+~P4(a500)
% 0.20/0.61 [20]P4(a500)+P2(a500)+~P1(a500)
% 0.20/0.61 [27]P2(a500)+~P1(a500)+~P3(a500)
% 0.20/0.61 %EqnAxiom
% 0.20/0.61
% 0.20/0.61 %-------------------------------------------
% 0.20/0.62 cnf(34,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[1,2,27,20,11]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------