%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN070+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 : 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:27 EDT 2024 % Result : Theorem 58.59s 59.04s % Output : CNFRefutation 58.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN070+1 : TPTP v8.2.0. Released v2.0.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.33 % Computer : n025.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sun Jun 23 20:50:24 EDT 2024 % 0.13/0.34 % CPUTime : % 0.20/0.57 start to proof:theBenchmark % 58.56/59.02 %------------------------------------------- % 58.56/59.02 % File :CSE---1.7 % 58.56/59.02 % Problem :theBenchmark % 58.56/59.02 % Transform :cnf % 58.56/59.02 % Format :tptp:raw % 58.56/59.02 % Command :java -jar mcs_scs.jar %d %s % 58.56/59.02 % 58.56/59.02 % Result :Theorem 58.000000s % 58.56/59.02 % Output :CNFRefutation 58.000000s % 58.56/59.02 %------------------------------------------- % 58.59/59.03 %-------------------------------------------------------------------------- % 58.59/59.03 % File : SYN070+1 : TPTP v8.2.0. Released v2.0.0. % 58.59/59.03 % Domain : Syntactic % 58.59/59.04 % Problem : Pelletier Problem 46 % 58.59/59.04 % Version : Especial. % 58.59/59.04 % English : % 58.59/59.04 % 58.59/59.04 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 58.59/59.04 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 58.59/59.04 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 58.59/59.04 % Source : [Hah94] % 58.59/59.04 % Names : Pelletier 46 [Pel86] % 58.59/59.04 % 58.59/59.04 % Status : Theorem % 58.59/59.04 % 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 % 58.59/59.04 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 58.59/59.04 % Number of atoms : 18 ( 0 equ) % 58.59/59.04 % Maximal formula atoms : 7 ( 4 avg) % 58.59/59.04 % Number of connectives : 18 ( 4 ~; 0 |; 8 &) % 58.59/59.04 % ( 0 <=>; 6 =>; 0 <=; 0 <~>) % 58.59/59.04 % Maximal formula depth : 9 ( 6 avg) % 58.59/59.04 % Maximal term depth : 1 ( 1 avg) % 58.59/59.04 % Number of predicates : 4 ( 4 usr; 0 prp; 1-2 aty) % 58.59/59.04 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 58.59/59.04 % Number of variables : 8 ( 6 !; 2 ?) % 58.59/59.04 % SPC : FOF_THM_EPR_NEQ % 58.59/59.04 % 58.59/59.04 % Comments : % 58.59/59.04 %-------------------------------------------------------------------------- % 58.59/59.04 fof(pel46_1,axiom, % 58.59/59.04 ! [X,Y] : % 58.59/59.04 ( ( big_f(X) % 58.59/59.04 & ( ( big_f(Y) % 58.59/59.04 & big_h(Y,X) ) % 58.59/59.04 => big_g(Y) ) ) % 58.59/59.04 => big_g(X) ) ). % 58.59/59.04 % 58.59/59.04 fof(pel46_2,axiom, % 58.59/59.04 ( ? [X] : % 58.59/59.04 ( big_f(X) % 58.59/59.04 & ~ big_g(X) ) % 58.59/59.04 => ? [X1] : % 58.59/59.04 ( big_f(X1) % 58.59/59.04 & ~ big_g(X1) % 58.59/59.04 & ! [Y] : % 58.59/59.04 ( ( big_f(Y) % 58.59/59.04 & ~ big_g(Y) ) % 58.59/59.04 => big_j(X1,Y) ) ) ) ). % 58.59/59.04 % 58.59/59.04 fof(pel46_3,axiom, % 58.59/59.04 ! [X,Y] : % 58.59/59.04 ( ( big_f(X) % 58.59/59.04 & big_f(Y) % 58.59/59.04 & big_h(X,Y) ) % 58.59/59.04 => ~ big_j(Y,X) ) ). % 58.59/59.04 % 58.59/59.04 fof(pel46,conjecture, % 58.59/59.04 ! [X] : % 58.59/59.04 ( big_f(X) % 58.59/59.04 => big_g(X) ) ). % 58.59/59.04 % 58.59/59.04 %-------------------------------------------------------------------------- % 58.59/59.04 %------------------------------------------- % 58.59/59.04 % Proof found % 58.59/59.04 % SZS status Theorem for theBenchmark % 58.59/59.04 % SZS output start Proof % 58.59/59.04 %ClaNum:9(EqnAxiom:0) % 58.59/59.04 %VarNum:21(SingletonVarNum:10) % 58.59/59.04 %MaxLitNum:5 % 58.59/59.04 %MaxfuncDepth:0 % 58.59/59.04 %SharedTerms:6 % 58.59/59.04 %goalClause: 1 2 % 58.59/59.04 %singleGoalClaCount:2 % 58.59/59.04 [1]P1(a1) % 58.59/59.04 [2]~P2(a1) % 58.59/59.04 [4]~P1(x42)+P1(x41)+P2(x42) % 58.59/59.04 [6]~P1(x61)+P2(x61)+~P2(x62) % 58.59/59.04 [7]~P1(x71)+P2(x71)+P3(x72,x71) % 58.59/59.05 [9]~P3(x92,x91)+~P4(x91,x92)+~P1(x91)+~P1(x92) % 58.59/59.05 [8]~P1(x81)+~P1(x82)+P2(x81)+P2(x82)+P4(a2,x82) % 58.59/59.05 %EqnAxiom % 58.59/59.05 % 58.59/59.05 %------------------------------------------- % 58.59/59.05 cnf(10,plain, % 58.59/59.05 (P1(x101)), % 58.59/59.05 inference(scs_inference,[],[1,2,4])). % 58.59/59.05 cnf(12,plain, % 58.59/59.05 (~P2(x121)), % 58.59/59.05 inference(scs_inference,[],[1,2,4,6])). % 58.59/59.05 cnf(16,plain, % 58.59/59.05 (P3(x161,x162)), % 58.59/59.05 inference(scs_inference,[],[10,12,7])). % 58.59/59.05 cnf(21,plain, % 58.59/59.05 (P1(x211)), % 58.59/59.05 inference(rename_variables,[],[10])). % 58.59/59.05 cnf(24,plain, % 58.59/59.05 ($false), % 58.59/59.05 inference(scs_inference,[],[12,16,10,21,9,8]), % 58.59/59.05 ['proof']). % 58.59/59.05 % SZS output end Proof % 58.59/59.05 % Total time :58.000000s %------------------------------------------------------------------------------