%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN057+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 : n025.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:23 EDT 2024 % Result : Theorem 0.53s 0.59s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN057+1 : TPTP v8.2.0. Released v2.0.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n025.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 22:14:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.56 start to proof:theBenchmark % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % File :CSE---1.7 % 0.53/0.59 % Problem :theBenchmark % 0.53/0.59 % Transform :cnf % 0.53/0.59 % Format :tptp:raw % 0.53/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.59 % 0.53/0.59 % Result :Theorem 0.000000s % 0.53/0.59 % Output :CNFRefutation 0.000000s % 0.53/0.59 %------------------------------------------- % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 % File : SYN057+1 : TPTP v8.2.0. Released v2.0.0. % 0.53/0.59 % Domain : Syntactic % 0.53/0.59 % Problem : Pelletier Problem 27 % 0.53/0.59 % Version : Especial. % 0.53/0.59 % English : % 0.53/0.59 % 0.53/0.59 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.53/0.59 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.53/0.59 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.53/0.59 % Source : [Hah94] % 0.53/0.59 % Names : Pelletier 27 [Pel86] % 0.53/0.59 % 0.53/0.59 % Status : Theorem % 0.53/0.59 % 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.53/0.59 % Syntax : Number of formulae : 5 ( 0 unt; 0 def) % 0.53/0.59 % Number of atoms : 13 ( 0 equ) % 0.53/0.59 % Maximal formula atoms : 4 ( 2 avg) % 0.53/0.59 % Number of connectives : 12 ( 4 ~; 0 |; 3 &) % 0.53/0.59 % ( 0 <=>; 5 =>; 0 <=; 0 <~>) % 0.53/0.59 % Maximal formula depth : 5 ( 4 avg) % 0.53/0.59 % Maximal term depth : 1 ( 1 avg) % 0.53/0.59 % Number of predicates : 5 ( 5 usr; 0 prp; 1-1 aty) % 0.53/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.53/0.59 % Number of variables : 6 ( 4 !; 2 ?) % 0.53/0.59 % SPC : FOF_THM_EPR_NEQ % 0.53/0.59 % 0.53/0.59 % Comments : % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 fof(pel27_1,axiom, % 0.53/0.59 ? [X] : % 0.53/0.59 ( big_f(X) % 0.53/0.59 & ~ big_g(X) ) ). % 0.53/0.59 % 0.53/0.59 fof(pel27_2,axiom, % 0.53/0.59 ! [X] : % 0.53/0.59 ( big_f(X) % 0.53/0.59 => big_h(X) ) ). % 0.53/0.59 % 0.53/0.59 fof(pel27_3,axiom, % 0.53/0.59 ! [X] : % 0.53/0.59 ( ( big_j(X) % 0.53/0.59 & big_i(X) ) % 0.53/0.59 => big_f(X) ) ). % 0.53/0.59 % 0.53/0.59 fof(pel27_4,axiom, % 0.53/0.59 ( ? [X] : % 0.53/0.59 ( big_h(X) % 0.53/0.59 & ~ big_g(X) ) % 0.53/0.59 => ! [X1] : % 0.53/0.59 ( big_i(X1) % 0.53/0.59 => ~ big_h(X1) ) ) ). % 0.53/0.59 % 0.53/0.59 fof(pel27,conjecture, % 0.53/0.59 ! [X] : % 0.53/0.59 ( big_j(X) % 0.53/0.59 => ~ big_i(X) ) ). % 0.53/0.59 % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % Proof found % 0.53/0.59 % SZS status Theorem for theBenchmark % 0.53/0.59 % SZS output start Proof % 0.53/0.59 %ClaNum:7(EqnAxiom:0) % 0.53/0.59 %VarNum:9(SingletonVarNum:4) % 0.53/0.59 %MaxLitNum:4 % 0.53/0.59 %MaxfuncDepth:0 % 0.53/0.59 %SharedTerms:6 % 0.53/0.59 %goalClause: 2 3 % 0.53/0.59 %singleGoalClaCount:2 % 0.53/0.59 [1]P1(a1) % 0.53/0.59 [2]P2(a2) % 0.53/0.59 [3]P3(a2) % 0.53/0.59 [4]~P4(a1) % 0.53/0.59 [5]~P1(x51)+P5(x51) % 0.53/0.59 [6]~P2(x61)+~P3(x61)+P1(x61) % 0.53/0.59 [7]~P5(x71)+~P3(x72)+P4(x71)+~P5(x72) % 0.53/0.59 %EqnAxiom % 0.56/0.59 % 0.56/0.59 %------------------------------------------- % 0.56/0.60 cnf(12,plain, % 0.56/0.60 (~P5(a1)), % 0.56/0.60 inference(scs_inference,[],[2,3,4,6,7,5])). % 0.56/0.60 cnf(13,plain, % 0.56/0.60 ($false), % 0.56/0.60 inference(scs_inference,[],[12,1,5]), % 0.56/0.60 ['proof']). % 0.56/0.60 % SZS output end Proof % 0.56/0.60 % Total time :0.000000s %------------------------------------------------------------------------------