%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN364+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 : n018.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:05:20 EDT 2024 % Result : Theorem 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN364+1 : TPTP v8.2.0. Released v2.0.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n018.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:38:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % File :CSE---1.7 % 0.52/0.58 % Problem :theBenchmark % 0.52/0.58 % Transform :cnf % 0.52/0.58 % Format :tptp:raw % 0.52/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.58 % 0.52/0.58 % Result :Theorem 0.000000s % 0.52/0.58 % Output :CNFRefutation 0.000000s % 0.52/0.58 %------------------------------------------- % 0.52/0.58 %-------------------------------------------------------------------------- % 0.52/0.58 % File : SYN364+1 : TPTP v8.2.0. Released v2.0.0. % 0.52/0.58 % Domain : Syntactic % 0.52/0.58 % Problem : Peter Andrews Problem X2115 % 0.52/0.58 % Version : Especial. % 0.52/0.58 % English : % 0.52/0.58 % 0.52/0.58 % Refs : [And86] Andrews (1986), An Introduction to Mathematical Logic % 0.52/0.58 % : [And94] Andrews (1994), Email to G. Sutcliffe % 0.52/0.58 % Source : [And94] % 0.52/0.58 % Names : X2115 [And86] % 0.52/0.58 % 0.52/0.58 % Status : Theorem % 0.52/0.58 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.5.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.11 v4.0.0, 0.10 v3.7.0, 0.00 v2.1.0 % 0.52/0.58 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.52/0.58 % Number of atoms : 9 ( 0 equ) % 0.52/0.58 % Maximal formula atoms : 9 ( 9 avg) % 0.52/0.59 % Number of connectives : 9 ( 1 ~; 1 |; 4 &) % 0.52/0.59 % ( 0 <=>; 3 =>; 0 <=; 0 <~>) % 0.52/0.59 % Maximal formula depth : 8 ( 8 avg) % 0.52/0.59 % Maximal term depth : 2 ( 1 avg) % 0.52/0.59 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 0.52/0.59 % Number of functors : 2 ( 2 usr; 0 con; 1-2 aty) % 0.52/0.59 % Number of variables : 8 ( 5 !; 3 ?) % 0.52/0.59 % SPC : FOF_THM_RFO_NEQ % 0.52/0.59 % 0.52/0.59 % Comments : % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 fof(x2115,conjecture, % 0.52/0.59 ( ( ! [X] : % 0.52/0.59 ( ? [Y] : big_p(X,Y) % 0.52/0.59 => ! [Z] : big_p(Z,Z) ) % 0.52/0.59 & ! [U] : % 0.52/0.59 ? [V] : % 0.52/0.59 ( big_p(U,V) % 0.52/0.59 | ( big_m(U) % 0.52/0.59 & big_q(f(U,V)) ) ) % 0.52/0.59 & ! [W] : % 0.52/0.59 ( big_q(W) % 0.52/0.59 => ~ big_m(g(W)) ) ) % 0.52/0.59 => ! [U] : % 0.52/0.59 ? [V] : % 0.52/0.59 ( big_p(g(U),V) % 0.52/0.59 & big_p(U,U) ) ) ). % 0.52/0.59 % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:5(EqnAxiom:0) % 0.52/0.59 %VarNum:14(SingletonVarNum:7) % 0.52/0.59 %MaxLitNum:2 % 0.52/0.59 %MaxfuncDepth:2 % 0.52/0.59 %SharedTerms:4 % 0.52/0.59 %goalClause: 1 2 3 4 5 % 0.52/0.59 [1]~P1(x11)+~P2(f1(x11)) % 0.52/0.59 [2]P2(x21)+P3(x21,f2(x21)) % 0.52/0.59 [4]~P3(f1(a4),x41)+~P3(a3,a3) % 0.52/0.59 [5]P3(x51,f2(x51))+P1(f6(x51,f5(x51))) % 0.52/0.59 [3]P3(x31,x31)+~P3(x32,x33) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.59 cnf(7,plain, % 0.52/0.59 (~P1(x71)+P3(f1(x71),f2(f1(x71)))), % 0.52/0.59 inference(scs_inference,[],[2,1])). % 0.52/0.59 cnf(8,plain, % 0.52/0.59 (~P3(x81,x82)+~P3(a3,a3)), % 0.52/0.59 inference(scs_inference,[],[3,4])). % 0.52/0.59 cnf(9,plain, % 0.52/0.59 (~P3(a3,a3)), % 0.52/0.59 inference(factoring_inference,[],[8])). % 0.52/0.59 cnf(10,plain, % 0.52/0.59 (~P3(x101,x102)), % 0.52/0.59 inference(scs_inference,[],[9,3])). % 0.52/0.59 cnf(12,plain, % 0.52/0.59 (~P1(x121)), % 0.52/0.59 inference(scs_inference,[],[9,3,7])). % 0.52/0.59 cnf(15,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[10,12,5]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------