%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN060+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 : n017.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:24 EDT 2024 % Result : Theorem 0.50s 0.61s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN060+1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n017.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 23:26:54 EDT 2024 % 0.12/0.34 % CPUTime : % 0.50/0.57 start to proof:theBenchmark % 0.50/0.61 %------------------------------------------- % 0.50/0.61 % File :CSE---1.7 % 0.50/0.61 % Problem :theBenchmark % 0.50/0.61 % Transform :cnf % 0.50/0.61 % Format :tptp:raw % 0.50/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.61 % 0.50/0.61 % Result :Theorem 0.000000s % 0.50/0.61 % Output :CNFRefutation 0.000000s % 0.50/0.61 %------------------------------------------- % 0.50/0.61 %-------------------------------------------------------------------------- % 0.50/0.61 % File : SYN060+1 : TPTP v8.2.0. Released v2.0.0. % 0.50/0.61 % Domain : Syntactic % 0.50/0.61 % Problem : Pelletier Problem 30 % 0.50/0.61 % Version : Especial. % 0.50/0.61 % English : % 0.50/0.61 % 0.50/0.61 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.50/0.61 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.50/0.61 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.50/0.61 % Source : [Hah94] % 0.50/0.61 % Names : Pelletier 30 [Pel86] % 0.50/0.61 % 0.50/0.61 % Status : Theorem % 0.50/0.61 % Rating : 0.00 v5.3.0, 0.09 v5.2.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.50/0.61 % Syntax : Number of formulae : 3 ( 1 unt; 0 def) % 0.50/0.61 % Number of atoms : 8 ( 0 equ) % 0.50/0.61 % Maximal formula atoms : 4 ( 2 avg) % 0.50/0.61 % Number of connectives : 7 ( 2 ~; 1 |; 1 &) % 0.50/0.61 % ( 0 <=>; 3 =>; 0 <=; 0 <~>) % 0.50/0.61 % Maximal formula depth : 5 ( 4 avg) % 0.50/0.61 % Maximal term depth : 1 ( 1 avg) % 0.50/0.61 % Number of predicates : 4 ( 4 usr; 0 prp; 1-1 aty) % 0.50/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.50/0.61 % Number of variables : 3 ( 3 !; 0 ?) % 0.50/0.61 % SPC : FOF_THM_EPR_NEQ % 0.50/0.61 % 0.50/0.61 % Comments : % 0.50/0.61 %-------------------------------------------------------------------------- % 0.50/0.61 fof(pel30_1,axiom, % 0.50/0.61 ! [X] : % 0.50/0.61 ( ( big_f(X) % 0.50/0.61 | big_g(X) ) % 0.50/0.61 => ~ big_h(X) ) ). % 0.50/0.61 % 0.50/0.61 fof(pel30_2,axiom, % 0.50/0.61 ! [X] : % 0.50/0.61 ( ( big_g(X) % 0.50/0.61 => ~ big_i(X) ) % 0.50/0.61 => ( big_f(X) % 0.50/0.61 & big_h(X) ) ) ). % 0.50/0.61 % 0.50/0.61 fof(pel30,conjecture, % 0.50/0.61 ! [X] : big_i(X) ). % 0.50/0.61 % 0.50/0.61 %-------------------------------------------------------------------------- % 0.50/0.61 %------------------------------------------- % 0.50/0.61 % Proof found % 0.50/0.61 % SZS status Theorem for theBenchmark % 0.50/0.61 % SZS output start Proof % 0.50/0.61 %ClaNum:7(EqnAxiom:0) % 0.50/0.61 %VarNum:12(SingletonVarNum:6) % 0.50/0.61 %MaxLitNum:2 % 0.50/0.61 %MaxfuncDepth:0 % 0.50/0.61 %SharedTerms:2 % 0.50/0.61 %goalClause: 1 % 0.50/0.61 %singleGoalClaCount:1 % 0.50/0.61 [1]~P1(a1) % 0.50/0.61 [2]P3(x21)+P2(x21) % 0.50/0.61 [3]P1(x31)+P2(x31) % 0.50/0.61 [4]P4(x41)+P3(x41) % 0.50/0.61 [5]P1(x51)+P4(x51) % 0.50/0.61 [6]~P4(x61)+~P2(x61) % 0.50/0.61 [7]~P4(x71)+~P3(x71) % 0.50/0.61 %EqnAxiom % 0.50/0.61 % 0.50/0.61 %------------------------------------------- % 0.50/0.62 cnf(9,plain, % 0.50/0.62 (~P4(a1)), % 0.50/0.62 inference(scs_inference,[],[1,3,6])). % 0.50/0.62 cnf(10,plain, % 0.50/0.62 ($false), % 0.50/0.62 inference(scs_inference,[],[1,9,5]), % 0.50/0.62 ['proof']). % 0.50/0.62 % SZS output end Proof % 0.50/0.62 % Total time :0.000000s %------------------------------------------------------------------------------