%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN040+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 : n001.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:18 EDT 2024 % Result : Theorem 0.60s 0.67s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : SYN040+1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.35 % Computer : n001.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sun Jun 23 19:32:08 EDT 2024 % 0.13/0.35 % CPUTime : % 0.57/0.63 start to proof:theBenchmark % 0.60/0.66 %------------------------------------------- % 0.60/0.66 % File :CSE---1.7 % 0.60/0.66 % Problem :theBenchmark % 0.60/0.66 % Transform :cnf % 0.60/0.66 % Format :tptp:raw % 0.60/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.66 % 0.60/0.66 % Result :Theorem 0.000000s % 0.60/0.66 % Output :CNFRefutation 0.000000s % 0.60/0.66 %------------------------------------------- % 0.60/0.67 %-------------------------------------------------------------------------- % 0.60/0.67 % File : SYN040+1 : TPTP v8.2.0. Released v2.0.0. % 0.60/0.67 % Domain : Syntactic % 0.60/0.67 % Problem : Pelletier Problem 1 % 0.60/0.67 % Version : Especial. % 0.60/0.67 % English : A biconditional version of the 'most difficult' theorem % 0.60/0.67 % proved by the original Logic Theorist. % 0.60/0.67 % 0.60/0.67 % Refs : [NSS63] Newell et al. (1963), Empirical Explorations with the % 0.60/0.67 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.60/0.67 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.60/0.67 % Source : [Hah94] % 0.60/0.67 % Names : Pelletier 1 [Pel86] % 0.60/0.67 % 0.60/0.67 % Status : Theorem % 0.60/0.67 % Rating : 0.00 v2.1.0 % 0.60/0.67 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.60/0.67 % Number of atoms : 4 ( 0 equ) % 0.60/0.67 % Maximal formula atoms : 4 ( 4 avg) % 0.60/0.67 % Number of connectives : 5 ( 2 ~; 0 |; 0 &) % 0.60/0.67 % ( 1 <=>; 2 =>; 0 <=; 0 <~>) % 0.60/0.67 % Maximal formula depth : 4 ( 4 avg) % 0.60/0.67 % Maximal term depth : 0 ( 0 avg) % 0.60/0.67 % Number of predicates : 2 ( 2 usr; 2 prp; 0-0 aty) % 0.60/0.67 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.60/0.67 % Number of variables : 0 ( 0 !; 0 ?) % 0.60/0.67 % SPC : FOF_THM_PRP % 0.60/0.67 % 0.60/0.67 % Comments : [NSS63] first appeared in 1957, as cited in [Pel86]. The 1963 % 0.60/0.67 % version is a reprint. % 0.60/0.67 %-------------------------------------------------------------------------- % 0.60/0.67 fof(pel1,conjecture, % 0.60/0.67 ( ( p % 0.60/0.67 => q ) % 0.60/0.67 <=> ( ~ q % 0.60/0.67 => ~ p ) ) ). % 0.60/0.67 % 0.60/0.67 %-------------------------------------------------------------------------- % 0.60/0.67 %------------------------------------------- % 0.60/0.67 % Proof found % 0.60/0.67 % SZS status Theorem for theBenchmark % 0.60/0.67 % SZS output start Proof % 0.60/0.67 %ClaNum:5(EqnAxiom:0) % 0.60/0.67 %VarNum:0(SingletonVarNum:0) % 0.60/0.67 %MaxLitNum:2 % 0.60/0.67 %MaxfuncDepth:0 % 0.60/0.67 %SharedTerms:5 % 0.60/0.67 %goalClause: 1 2 5 % 0.60/0.67 %singleGoalClaCount:2 % 0.60/0.67 [1]P1(a5000) % 0.60/0.67 [2]~P2(a5000) % 0.60/0.67 [5]P2(a5000)+~P1(a5000) % 0.60/0.67 %EqnAxiom % 0.60/0.67 % 0.60/0.67 %------------------------------------------- % 0.60/0.67 cnf(6,plain, % 0.60/0.67 ($false), % 0.60/0.67 inference(scs_inference,[],[2,1,5]), % 0.60/0.67 ['proof']). % 0.60/0.67 % SZS output end Proof % 0.60/0.67 % Total time :0.000000s %------------------------------------------------------------------------------