%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN063+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 : n021.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:25 EDT 2024 % Result : Theorem 0.54s 0.59s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN063+1 : TPTP v8.2.0. Released v2.0.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.32 % Computer : n021.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 300 % 0.12/0.32 % DateTime : Sun Jun 23 22:40:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.18/0.56 start to proof:theBenchmark % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % File :CSE---1.7 % 0.52/0.59 % Problem :theBenchmark % 0.52/0.59 % Transform :cnf % 0.52/0.59 % Format :tptp:raw % 0.52/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.59 % 0.52/0.59 % Result :Theorem 0.000000s % 0.52/0.59 % Output :CNFRefutation 0.000000s % 0.52/0.59 %------------------------------------------- % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 % File : SYN063+1 : TPTP v8.2.0. Released v2.0.0. % 0.54/0.59 % Domain : Syntactic % 0.54/0.59 % Problem : Pelletier Problem 33 % 0.54/0.59 % Version : Especial. % 0.54/0.59 % English : % 0.54/0.59 % 0.54/0.59 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.54/0.59 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.54/0.59 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.54/0.59 % Source : [Hah94] % 0.54/0.59 % Names : Pelletier 33 [Pel86] % 0.54/0.59 % 0.54/0.59 % Status : Theorem % 0.54/0.59 % Rating : 0.00 v5.5.0, 0.11 v5.4.0, 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.54/0.59 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.54/0.59 % Number of atoms : 10 ( 0 equ) % 0.54/0.59 % Maximal formula atoms : 10 ( 10 avg) % 0.54/0.59 % Number of connectives : 12 ( 3 ~; 4 |; 2 &) % 0.54/0.59 % ( 1 <=>; 2 =>; 0 <=; 0 <~>) % 0.54/0.59 % Maximal formula depth : 7 ( 7 avg) % 0.54/0.59 % Maximal term depth : 1 ( 1 avg) % 0.54/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.54/0.59 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty) % 0.54/0.59 % Number of variables : 2 ( 2 !; 0 ?) % 0.54/0.59 % SPC : FOF_THM_EPR_NEQ % 0.54/0.59 % 0.54/0.59 % Comments : This is a monadic predicate formulation of Pelletier 17. % 0.54/0.59 %-------------------------------------------------------------------------- % 0.54/0.59 fof(pel33,conjecture, % 0.54/0.59 ( ! [X] : % 0.54/0.59 ( ( big_p(a) % 0.54/0.59 & ( big_p(X) % 0.54/0.59 => big_p(b) ) ) % 0.54/0.59 => big_p(c) ) % 0.54/0.59 <=> ! [X1] : % 0.54/0.59 ( ( ~ big_p(a) % 0.54/0.59 | big_p(X1) % 0.54/0.59 | big_p(c) ) % 0.54/0.59 & ( ~ big_p(a) % 0.54/0.59 | ~ big_p(b) % 0.54/0.59 | big_p(c) ) ) ) ). % 0.54/0.59 % 0.54/0.59 %-------------------------------------------------------------------------- % 0.54/0.59 %------------------------------------------- % 0.54/0.59 % Proof found % 0.54/0.59 % SZS status Theorem for theBenchmark % 0.54/0.59 % SZS output start Proof % 0.54/0.59 %ClaNum:31(EqnAxiom:0) % 0.54/0.59 %VarNum:2(SingletonVarNum:2) % 0.54/0.59 %MaxLitNum:4 % 0.54/0.59 %MaxfuncDepth:0 % 0.54/0.59 %SharedTerms:13 % 0.54/0.59 %goalClause: 1 2 23 24 28 % 0.54/0.59 %singleGoalClaCount:2 % 0.54/0.59 [1]P1(a1) % 0.54/0.60 [2]~P1(a2) % 0.54/0.60 [23]P1(a3)+~P1(a5)+~P1(a4) % 0.54/0.60 [24]P1(a2)+~P1(a1)+~P1(a3) % 0.54/0.60 [28]P1(x281)+P1(x282)+P1(a2)+~P1(a1) % 0.54/0.60 %EqnAxiom % 0.54/0.60 % 0.54/0.60 %------------------------------------------- % 0.54/0.60 cnf(32,plain, % 0.54/0.60 (P1(a2)+~P1(a1)), % 0.54/0.60 inference(factoring_inference,[],[28])). % 0.54/0.60 cnf(33,plain, % 0.54/0.60 ($false), % 0.54/0.60 inference(scs_inference,[],[2,1,32]), % 0.54/0.60 ['proof']). % 0.54/0.60 % SZS output end Proof % 0.54/0.60 % Total time :0.000000s %------------------------------------------------------------------------------