%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN062+1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n019.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.20s 0.61s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN062+1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n019.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Jun 23 20:29:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.57 start to proof:theBenchmark % 0.20/0.60 %------------------------------------------- % 0.20/0.60 % File :CSE---1.7 % 0.20/0.60 % Problem :theBenchmark % 0.20/0.60 % Transform :cnf % 0.20/0.60 % Format :tptp:raw % 0.20/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.60 % 0.20/0.60 % Result :Theorem 0.000000s % 0.20/0.60 % Output :CNFRefutation 0.000000s % 0.20/0.60 %------------------------------------------- % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 % File : SYN062+1 : TPTP v8.2.0. Released v2.0.0. % 0.20/0.60 % Domain : Syntactic % 0.20/0.60 % Problem : Pelletier Problem 32 % 0.20/0.60 % Version : Especial. % 0.20/0.60 % English : % 0.20/0.60 % 0.20/0.60 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.20/0.60 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.20/0.60 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.20/0.60 % Source : [Hah94] % 0.20/0.60 % Names : Pelletier 32 [Pel86] % 0.20/0.60 % 0.20/0.60 % Status : Theorem % 0.20/0.60 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0 % 0.20/0.60 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.20/0.60 % Number of atoms : 12 ( 0 equ) % 0.20/0.60 % Maximal formula atoms : 4 ( 3 avg) % 0.20/0.60 % Number of connectives : 8 ( 0 ~; 1 |; 3 &) % 0.20/0.60 % ( 0 <=>; 4 =>; 0 <=; 0 <~>) % 0.20/0.60 % Maximal formula depth : 5 ( 4 avg) % 0.20/0.60 % Maximal term depth : 1 ( 1 avg) % 0.20/0.60 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty) % 0.20/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.20/0.60 % Number of variables : 4 ( 4 !; 0 ?) % 0.20/0.60 % SPC : FOF_THM_EPR_NEQ % 0.20/0.60 % 0.20/0.60 % Comments : % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 fof(pel32_1,axiom, % 0.20/0.60 ! [X] : % 0.20/0.60 ( ( big_f(X) % 0.20/0.61 & ( big_g(X) % 0.20/0.61 | big_h(X) ) ) % 0.20/0.61 => big_i(X) ) ). % 0.20/0.61 % 0.20/0.61 fof(pel32_2,axiom, % 0.20/0.61 ! [X] : % 0.20/0.61 ( ( big_i(X) % 0.20/0.61 & big_h(X) ) % 0.20/0.61 => big_j(X) ) ). % 0.20/0.61 % 0.20/0.61 fof(pel32_3,axiom, % 0.20/0.61 ! [X] : % 0.20/0.61 ( big_k(X) % 0.20/0.61 => big_h(X) ) ). % 0.20/0.61 % 0.20/0.61 fof(pel32,conjecture, % 0.20/0.61 ! [X] : % 0.20/0.61 ( ( big_f(X) % 0.20/0.61 & big_k(X) ) % 0.20/0.61 => big_j(X) ) ). % 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:7(EqnAxiom:0) % 0.20/0.61 %VarNum:11(SingletonVarNum:4) % 0.20/0.61 %MaxLitNum:3 % 0.20/0.61 %MaxfuncDepth:0 % 0.20/0.61 %SharedTerms:4 % 0.20/0.61 %goalClause: 1 2 3 % 0.20/0.61 %singleGoalClaCount:3 % 0.20/0.61 [1]P1(a1) % 0.20/0.61 [2]P2(a1) % 0.20/0.61 [3]~P3(a1) % 0.20/0.61 [4]~P2(x41)+P4(x41) % 0.20/0.61 [5]~P1(x51)+~P5(x51)+P6(x51) % 0.20/0.61 [6]~P1(x61)+~P4(x61)+P6(x61) % 0.20/0.61 [7]~P4(x71)+~P6(x71)+P3(x71) % 0.57/0.61 %EqnAxiom % 0.57/0.61 % 0.57/0.61 %------------------------------------------- % 0.57/0.61 cnf(8,plain, % 0.57/0.61 (P6(a1)), % 0.57/0.61 inference(scs_inference,[],[2,1,4,6])). % 0.57/0.61 cnf(11,plain, % 0.57/0.61 ($false), % 0.57/0.61 inference(scs_inference,[],[2,3,8,7,4]), % 0.57/0.61 ['proof']). % 0.57/0.61 % SZS output end Proof % 0.57/0.61 % Total time :0.000000s %------------------------------------------------------------------------------