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