%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN069+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 : n029.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:27 EDT 2024 % Result : Theorem 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN069+1 : TPTP v8.2.0. Released v2.0.0. % 0.06/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.32 % Computer : n029.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 20:09:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.52/0.55 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 : SYN069+1 : TPTP v8.2.0. Released v2.0.0. % 0.52/0.59 % Domain : Syntactic % 0.52/0.59 % Problem : Pelletier Problem 45 % 0.52/0.59 % Version : Especial. % 0.52/0.59 % English : % 0.52/0.59 % 0.52/0.59 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.52/0.59 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.52/0.59 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.52/0.59 % Source : [Hah94] % 0.52/0.59 % Names : Pelletier 45 [Pel86] % 0.52/0.59 % 0.52/0.59 % Status : ContradictoryAxioms % 0.52/0.59 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.0.1, 0.05 v3.7.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.52/0.59 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.52/0.59 % Number of atoms : 18 ( 0 equ) % 0.52/0.59 % Maximal formula atoms : 7 ( 4 avg) % 0.52/0.59 % Number of connectives : 16 ( 2 ~; 0 |; 10 &) % 0.52/0.59 % ( 0 <=>; 4 =>; 0 <=; 0 <~>) % 0.52/0.59 % Maximal formula depth : 7 ( 6 avg) % 0.52/0.59 % Maximal term depth : 1 ( 1 avg) % 0.52/0.59 % Number of predicates : 6 ( 6 usr; 0 prp; 1-2 aty) % 0.52/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.52/0.59 % Number of variables : 9 ( 5 !; 4 ?) % 0.52/0.59 % SPC : FOF_CAX_RFO_NEQ % 0.52/0.59 % 0.52/0.59 % Comments : % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 fof(pel45_1,axiom, % 0.52/0.59 ! [X] : % 0.52/0.59 ( ( big_f(X) % 0.52/0.59 & ! [Y] : % 0.52/0.59 ( ( big_g(Y) % 0.52/0.59 & big_h(X,Y) ) % 0.52/0.59 => big_j(X,Y) ) ) % 0.52/0.59 => ! [Y1] : % 0.52/0.59 ( big_g(Y1) % 0.52/0.59 & big_h(X,Y1) % 0.52/0.59 & big_k(Y1) ) ) ). % 0.52/0.59 % 0.52/0.59 fof(pel45_2,axiom, % 0.52/0.59 ~ ? [Y] : % 0.52/0.59 ( big_l(Y) % 0.52/0.59 & big_k(Y) ) ). % 0.52/0.59 % 0.52/0.59 fof(pel45_3,axiom, % 0.52/0.59 ? [X] : % 0.52/0.59 ( big_f(X) % 0.52/0.59 & ! [Y] : % 0.52/0.59 ( big_h(X,Y) % 0.52/0.59 => big_l(Y) ) % 0.52/0.59 & ! [Y1] : % 0.52/0.59 ( ( big_g(Y1) % 0.52/0.59 & big_h(X,Y1) ) % 0.52/0.59 => big_j(X,Y1) ) ) ). % 0.52/0.59 % 0.52/0.59 fof(pel45,conjecture, % 0.52/0.59 ? [X] : % 0.52/0.59 ( big_f(X) % 0.52/0.59 & ~ ? [Y] : % 0.52/0.59 ( big_g(Y) % 0.52/0.59 & big_h(X,Y) ) ) ). % 0.52/0.59 % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:15(EqnAxiom:0) % 0.52/0.59 %VarNum:33(SingletonVarNum:15) % 0.52/0.59 %MaxLitNum:3 % 0.52/0.59 %MaxfuncDepth:1 % 0.52/0.59 %SharedTerms:2 % 0.52/0.59 %goalClause: 3 7 % 0.52/0.59 [1]P1(a1) % 0.52/0.59 [2]~P6(x21)+~P2(x21) % 0.52/0.59 [6]P6(x61)+~P4(a1,x61) % 0.52/0.59 [3]~P1(x31)+P3(f3(x31)) % 0.52/0.59 [7]~P1(x71)+P4(x71,f3(x71)) % 0.52/0.59 [11]~P3(x111)+~P4(a1,x111)+P5(a1,x111) % 0.52/0.59 [4]~P1(x42)+P3(x41)+P3(f2(x42)) % 0.52/0.59 [12]~P1(x121)+P4(x121,x122)+P4(x121,f2(x121)) % 0.52/0.59 [13]P3(x131)+~P1(x132)+~P5(x132,f2(x132)) % 0.52/0.59 [14]P2(x141)+~P1(x142)+~P5(x142,f2(x142)) % 0.52/0.59 [15]~P1(x151)+P4(x151,x152)+~P5(x151,f2(x151)) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.60 cnf(16,plain, % 0.52/0.60 (~P6(x161)+~P5(a1,f2(a1))), % 0.52/0.60 inference(scs_inference,[],[1,2,14])). % 0.52/0.60 cnf(18,plain, % 0.52/0.60 (~P4(a1,x181)+~P5(a1,f2(a1))), % 0.52/0.60 inference(scs_inference,[],[6,16])). % 0.52/0.60 cnf(19,plain, % 0.52/0.60 (~P5(a1,f2(a1))), % 0.52/0.60 inference(scs_inference,[],[1,7,18])). % 0.52/0.60 cnf(20,plain, % 0.52/0.60 (~P4(a1,f2(a1))+P3(f2(a1))), % 0.52/0.60 inference(scs_inference,[],[1,19,4,11])). % 0.52/0.60 cnf(21,plain, % 0.52/0.60 (~P4(a1,f2(a1))), % 0.52/0.60 inference(scs_inference,[],[19,20,11])). % 0.52/0.60 cnf(22,plain, % 0.52/0.60 ($false), % 0.52/0.60 inference(scs_inference,[],[1,21,12]), % 0.52/0.60 ['proof']). % 0.52/0.60 % SZS output end Proof % 0.52/0.60 % Total time :0.000000s %------------------------------------------------------------------------------