%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN044+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 : n024.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.20s 0.61s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN044+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 : n024.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 21:39:39 EDT 2024 % 0.12/0.34 % CPUTime : % 0.20/0.57 start to proof:theBenchmark % 0.20/0.60 %------------------------------------------- % 0.20/0.60 % File :CSE---1.7 % 0.20/0.60 % Problem :theBenchmark % 0.20/0.60 % Transform :cnf % 0.20/0.60 % Format :tptp:raw % 0.20/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.60 % 0.20/0.60 % Result :Theorem 0.000000s % 0.20/0.60 % Output :CNFRefutation 0.000000s % 0.20/0.60 %------------------------------------------- % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 % File : SYN044+1 : TPTP v8.2.0. Released v2.0.0. % 0.20/0.60 % Domain : Syntactic % 0.20/0.60 % Problem : Pelletier Problem 10 % 0.20/0.60 % Version : Especial. % 0.20/0.61 % English : A reasonably simple probloem designed to see whether 'natural' % 0.20/0.61 % systems correctly manipulate premises. % 0.20/0.61 % 0.20/0.61 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.20/0.61 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.20/0.61 % Source : [Hah94] % 0.20/0.61 % Names : Pelletier 10 [Pel86] % 0.20/0.61 % 0.20/0.61 % Status : Theorem % 0.20/0.61 % Rating : 0.00 v2.1.0 % 0.20/0.61 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.20/0.61 % Number of atoms : 10 ( 0 equ) % 0.20/0.61 % Maximal formula atoms : 3 ( 2 avg) % 0.20/0.61 % Number of connectives : 6 ( 0 ~; 1 |; 1 &) % 0.20/0.61 % ( 1 <=>; 3 =>; 0 <=; 0 <~>) % 0.20/0.61 % Maximal formula depth : 3 ( 3 avg) % 0.20/0.61 % Maximal term depth : 0 ( 0 avg) % 0.20/0.61 % Number of predicates : 3 ( 3 usr; 3 prp; 0-0 aty) % 0.20/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.20/0.61 % Number of variables : 0 ( 0 !; 0 ?) % 0.20/0.61 % SPC : FOF_THM_PRP % 0.20/0.61 % 0.20/0.61 % Comments : % 0.20/0.61 %-------------------------------------------------------------------------- % 0.20/0.61 fof(pel10_1,axiom, % 0.20/0.61 ( q % 0.20/0.61 => r ) ). % 0.20/0.61 % 0.20/0.61 fof(pel10_2,axiom, % 0.20/0.61 ( r % 0.20/0.61 => ( p % 0.20/0.61 & q ) ) ). % 0.20/0.61 % 0.20/0.61 fof(pel10_3,axiom, % 0.20/0.61 ( p % 0.20/0.61 => ( q % 0.20/0.61 | r ) ) ). % 0.20/0.61 % 0.20/0.61 fof(pel10,conjecture, % 0.20/0.61 ( p % 0.20/0.61 <=> q ) ). % 0.20/0.61 % 0.20/0.61 %-------------------------------------------------------------------------- % 0.20/0.61 %------------------------------------------- % 0.20/0.61 % Proof found % 0.20/0.61 % SZS status Theorem for theBenchmark % 0.20/0.61 % SZS output start Proof % 0.20/0.61 %ClaNum:6(EqnAxiom:0) % 0.20/0.61 %VarNum:0(SingletonVarNum:0) % 0.20/0.61 %MaxLitNum:3 % 0.20/0.61 %MaxfuncDepth:0 % 0.20/0.61 %SharedTerms:7 % 0.20/0.61 %goalClause: 1 5 % 0.20/0.61 [1]P1(a5000)+P2(a5000) % 0.20/0.61 [2]P1(a5000)+~P3(a5000) % 0.20/0.61 [3]P3(a5000)+~P1(a5000) % 0.20/0.61 [4]P2(a5000)+~P3(a5000) % 0.20/0.61 [5]~P1(a5000)+~P2(a5000) % 0.20/0.61 [6]P1(a5000)+P3(a5000)+~P2(a5000) % 0.20/0.61 %EqnAxiom % 0.20/0.61 % 0.20/0.61 %------------------------------------------- % 0.57/0.61 cnf(7,plain, % 0.57/0.61 (P2(a5000)+P3(a5000)), % 0.57/0.61 inference(scs_inference,[],[1,3])). % 0.57/0.61 cnf(8,plain, % 0.57/0.61 (~P3(a5000)+~P2(a5000)), % 0.57/0.61 inference(scs_inference,[],[2,5])). % 0.57/0.61 cnf(9,plain, % 0.57/0.61 (~P3(a5000)), % 0.57/0.61 inference(scs_inference,[],[4,8])). % 0.57/0.61 cnf(10,plain, % 0.57/0.61 (~P1(a5000)), % 0.57/0.61 inference(scs_inference,[],[9,3])). % 0.57/0.61 cnf(11,plain, % 0.57/0.61 (P1(a5000)+~P2(a5000)), % 0.57/0.61 inference(scs_inference,[],[9,6])). % 0.57/0.61 cnf(12,plain, % 0.57/0.61 (P2(a5000)), % 0.57/0.61 inference(scs_inference,[],[9,7])). % 0.57/0.61 cnf(15,plain, % 0.57/0.61 ($false), % 0.57/0.61 inference(scs_inference,[],[10,12,11]), % 0.57/0.61 ['proof']). % 0.57/0.61 % SZS output end Proof % 0.57/0.61 % Total time :0.000000s %------------------------------------------------------------------------------