%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN377+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 : n032.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:22 EDT 2024 % Result : Theorem 0.12s 0.46s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.08 % Problem : SYN377+1 : TPTP v8.2.0. Released v2.0.0. % 0.02/0.08 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.07/0.26 % Computer : n032.cluster.edu % 0.07/0.26 % Model : x86_64 x86_64 % 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.26 % Memory : 8042.1875MB % 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.26 % CPULimit : 300 % 0.07/0.26 % WCLimit : 300 % 0.07/0.26 % DateTime : Sun Jun 23 23:25:38 EDT 2024 % 0.07/0.26 % CPUTime : % 0.12/0.43 start to proof:theBenchmark % 0.12/0.46 %------------------------------------------- % 0.12/0.46 % File :CSE---1.7 % 0.12/0.46 % Problem :theBenchmark % 0.12/0.46 % Transform :cnf % 0.12/0.46 % Format :tptp:raw % 0.12/0.46 % Command :java -jar mcs_scs.jar %d %s % 0.12/0.46 % 0.12/0.46 % Result :Theorem 0.000000s % 0.12/0.46 % Output :CNFRefutation 0.000000s % 0.12/0.46 %------------------------------------------- % 0.12/0.46 %-------------------------------------------------------------------------- % 0.12/0.46 % File : SYN377+1 : TPTP v8.2.0. Released v2.0.0. % 0.12/0.46 % Domain : Syntactic % 0.12/0.46 % Problem : Peter Andrews Problem X2128 % 0.12/0.46 % Version : Especial. % 0.12/0.46 % English : % 0.12/0.46 % 0.12/0.46 % Refs : [And86] Andrews (1986), An Introduction to Mathematical Logic % 0.12/0.46 % : [And94] Andrews (1994), Email to G. Sutcliffe % 0.12/0.46 % Source : [And94] % 0.12/0.46 % Names : X2128 [And86] % 0.12/0.46 % 0.12/0.46 % Status : Theorem % 0.12/0.46 % Rating : 0.00 v8.2.0, 0.07 v8.1.0, 0.00 v6.4.0, 0.07 v6.3.0, 0.08 v6.2.0, 0.09 v6.1.0, 0.04 v6.0.0, 0.00 v5.5.0, 0.08 v5.4.0, 0.09 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.15 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.11 v3.2.0, 0.22 v3.1.0, 0.17 v2.7.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0 % 0.12/0.46 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.12/0.46 % Number of atoms : 4 ( 0 equ) % 0.12/0.46 % Maximal formula atoms : 4 ( 4 avg) % 0.12/0.46 % Number of connectives : 3 ( 0 ~; 0 |; 0 &) % 0.12/0.46 % ( 3 <=>; 0 =>; 0 <=; 0 <~>) % 0.12/0.46 % Maximal formula depth : 5 ( 5 avg) % 0.12/0.46 % Maximal term depth : 1 ( 1 avg) % 0.12/0.46 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.12/0.46 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.12/0.46 % Number of variables : 4 ( 3 !; 1 ?) % 0.12/0.46 % SPC : FOF_THM_RFO_NEQ % 0.12/0.46 % 0.12/0.46 % Comments : % 0.12/0.46 %-------------------------------------------------------------------------- % 0.12/0.46 fof(x2128,conjecture, % 0.12/0.46 ( ! [X] : % 0.12/0.46 ( big_p(X) % 0.12/0.46 <=> ! [Y] : big_p(Y) ) % 0.12/0.46 <=> ( ? [X] : big_p(X) % 0.12/0.46 <=> ! [Y] : big_p(Y) ) ) ). % 0.12/0.46 % 0.12/0.46 %-------------------------------------------------------------------------- % 0.12/0.46 %------------------------------------------- % 0.12/0.46 % Proof found % 0.12/0.46 % SZS status Theorem for theBenchmark % 0.12/0.46 % SZS output start Proof % 0.12/0.46 %ClaNum:8(EqnAxiom:0) % 0.12/0.46 %VarNum:7(SingletonVarNum:7) % 0.12/0.46 %MaxLitNum:4 % 0.12/0.46 %MaxfuncDepth:0 % 0.12/0.46 %SharedTerms:15 % 0.12/0.46 %goalClause: 1 7 8 % 0.12/0.46 [7]~P1(x71)+~P1(a1)+~P1(a3)+~P1(a4) % 0.12/0.46 [1]P1(x11)+P1(x12)+P1(a1)+P1(a2) % 0.12/0.46 [8]P1(x81)+P1(x82)+~P1(x83)+~P1(x84) % 0.12/0.46 %EqnAxiom % 0.12/0.46 % 0.12/0.46 %------------------------------------------- % 0.12/0.47 cnf(9,plain, % 0.12/0.47 (P1(a1)+P1(a2)), % 0.12/0.47 inference(factoring_inference,[],[1])). % 0.12/0.47 cnf(10,plain, % 0.12/0.47 (~P1(a1)+~P1(a4)+~P1(a3)), % 0.12/0.47 inference(factoring_inference,[],[7])). % 0.12/0.47 cnf(12,plain, % 0.12/0.47 (P1(x121)+P1(x122)+P1(a1)), % 0.12/0.47 inference(scs_inference,[],[9,8])). % 0.12/0.47 cnf(13,plain, % 0.12/0.47 (P1(a1)), % 0.12/0.47 inference(factoring_inference,[],[12])). % 0.12/0.47 cnf(14,plain, % 0.12/0.47 (P1(x141)+P1(x142)), % 0.12/0.47 inference(scs_inference,[],[13,8])). % 0.12/0.47 cnf(15,plain, % 0.12/0.47 (~P1(a4)+~P1(a3)), % 0.12/0.47 inference(scs_inference,[],[13,10])). % 0.12/0.47 cnf(16,plain, % 0.12/0.47 (~P1(a3)), % 0.12/0.47 inference(scs_inference,[],[14,15])). % 0.12/0.47 cnf(18,plain, % 0.12/0.47 ($false), % 0.12/0.47 inference(scs_inference,[],[16,14]), % 0.12/0.47 ['proof']). % 0.12/0.47 % SZS output end Proof % 0.12/0.47 % Total time :0.000000s %------------------------------------------------------------------------------