%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN055+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 : n027.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:22 EDT 2024 % Result : Theorem 0.19s 0.59s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYN055+1 : TPTP v8.2.0. Released v2.0.0. % 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.32 % Computer : n027.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:45:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.55 start to proof:theBenchmark % 0.19/0.58 %------------------------------------------- % 0.19/0.58 % File :CSE---1.7 % 0.19/0.58 % Problem :theBenchmark % 0.19/0.58 % Transform :cnf % 0.19/0.58 % Format :tptp:raw % 0.19/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.19/0.58 % 0.19/0.58 % Result :Theorem 0.000000s % 0.19/0.58 % Output :CNFRefutation 0.000000s % 0.19/0.58 %------------------------------------------- % 0.19/0.58 %-------------------------------------------------------------------------- % 0.19/0.58 % File : SYN055+1 : TPTP v8.2.0. Released v2.0.0. % 0.19/0.58 % Domain : Syntactic % 0.19/0.58 % Problem : Pelletier Problem 25 % 0.19/0.58 % Version : Especial. % 0.19/0.58 % English : % 0.19/0.58 % 0.19/0.58 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.19/0.58 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.19/0.58 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.19/0.58 % Source : [Hah94] % 0.19/0.58 % Names : Pelletier 25 [Pel86] % 0.19/0.58 % 0.19/0.58 % Status : ContradictoryAxioms % 0.19/0.58 % Rating : 0.00 v8.1.0, 0.07 v7.5.0, 0.10 v7.4.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0 % 0.19/0.58 % Syntax : Number of formulae : 5 ( 1 unt; 0 def) % 0.19/0.58 % Number of atoms : 13 ( 0 equ) % 0.19/0.58 % Maximal formula atoms : 4 ( 2 avg) % 0.19/0.58 % Number of connectives : 9 ( 1 ~; 1 |; 4 &) % 0.19/0.58 % ( 0 <=>; 3 =>; 0 <=; 0 <~>) % 0.19/0.58 % Maximal formula depth : 5 ( 4 avg) % 0.19/0.58 % Maximal term depth : 1 ( 1 avg) % 0.19/0.58 % Number of predicates : 5 ( 5 usr; 0 prp; 1-1 aty) % 0.19/0.58 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.19/0.58 % Number of variables : 6 ( 3 !; 3 ?) % 0.19/0.58 % SPC : FOF_CAX_RFO_NEQ % 0.19/0.58 % 0.19/0.58 % Comments : % 0.19/0.58 %-------------------------------------------------------------------------- % 0.19/0.58 fof(pel25_1,axiom, % 0.19/0.58 ? [X] : big_p(X) ). % 0.19/0.58 % 0.19/0.58 fof(pel25_2,axiom, % 0.19/0.58 ! [X] : % 0.19/0.58 ( big_f(X) % 0.19/0.58 => ( ~ big_g(X) % 0.19/0.58 & big_r(X) ) ) ). % 0.19/0.58 % 0.19/0.58 fof(pel25_3,axiom, % 0.19/0.58 ! [X] : % 0.19/0.58 ( big_p(X) % 0.19/0.58 => ( big_g(X) % 0.19/0.58 & big_f(X) ) ) ). % 0.19/0.58 % 0.19/0.58 fof(pel25_4,axiom, % 0.19/0.58 ( ! [X] : % 0.19/0.58 ( big_p(X) % 0.19/0.58 => big_q(X) ) % 0.19/0.58 | ? [Z] : % 0.19/0.58 ( big_p(Z) % 0.19/0.58 & big_r(Z) ) ) ). % 0.19/0.59 % 0.19/0.59 fof(pel25,conjecture, % 0.19/0.59 ? [X] : % 0.19/0.59 ( big_q(X) % 0.19/0.59 & big_p(X) ) ). % 0.19/0.59 % 0.19/0.59 %-------------------------------------------------------------------------- % 0.19/0.59 %------------------------------------------- % 0.19/0.59 % Proof found % 0.19/0.59 % SZS status Theorem for theBenchmark % 0.19/0.59 % SZS output start Proof % 0.19/0.59 %ClaNum:8(EqnAxiom:0) % 0.19/0.59 %VarNum:14(SingletonVarNum:7) % 0.19/0.59 %MaxLitNum:3 % 0.19/0.59 %MaxfuncDepth:0 % 0.19/0.59 %SharedTerms:5 % 0.19/0.59 %goalClause: 5 % 0.19/0.59 [1]P1(a1) % 0.19/0.59 [2]~P1(x21)+P2(x21) % 0.19/0.59 [3]~P1(x31)+P3(x31) % 0.19/0.59 [4]~P2(x41)+P4(x41) % 0.19/0.59 [5]~P5(x51)+~P1(x51) % 0.19/0.59 [6]~P3(x61)+~P2(x61) % 0.19/0.59 [7]~P1(x71)+P5(x71)+P1(a2) % 0.19/0.59 [8]~P1(x81)+P5(x81)+P4(a2) % 0.19/0.59 %EqnAxiom % 0.19/0.59 % 0.19/0.59 %------------------------------------------- % 0.19/0.59 cnf(11,plain, % 0.19/0.59 (~P3(a1)), % 0.19/0.59 inference(scs_inference,[],[1,2,6])). % 0.19/0.59 cnf(12,plain, % 0.19/0.59 ($false), % 0.19/0.59 inference(scs_inference,[],[1,11,3]), % 0.19/0.59 ['proof']). % 0.19/0.59 % SZS output end Proof % 0.19/0.59 % Total time :0.000000s %------------------------------------------------------------------------------