%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN374+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 : n019.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:21 EDT 2024 % Result : Theorem 0.21s 0.60s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN374+1 : TPTP v8.2.0. Released v2.0.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sun Jun 23 19:39:54 EDT 2024 % 0.12/0.34 % CPUTime : % 0.21/0.57 start to proof:theBenchmark % 0.21/0.60 %------------------------------------------- % 0.21/0.60 % File :CSE---1.7 % 0.21/0.60 % Problem :theBenchmark % 0.21/0.60 % Transform :cnf % 0.21/0.60 % Format :tptp:raw % 0.21/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.21/0.60 % 0.21/0.60 % Result :Theorem 0.000000s % 0.21/0.60 % Output :CNFRefutation 0.000000s % 0.21/0.60 %------------------------------------------- % 0.21/0.60 %-------------------------------------------------------------------------- % 0.21/0.60 % File : SYN374+1 : TPTP v8.2.0. Released v2.0.0. % 0.21/0.60 % Domain : Syntactic % 0.21/0.60 % Problem : Peter Andrews Problem X2125 % 0.21/0.60 % Version : Especial. % 0.21/0.60 % English : % 0.21/0.60 % 0.21/0.60 % Refs : [And86] Andrews (1986), An Introduction to Mathematical Logic % 0.21/0.60 % : [And94] Andrews (1994), Email to G. Sutcliffe % 0.21/0.60 % Source : [And94] % 0.21/0.60 % Names : X2125 [And86] % 0.21/0.60 % 0.21/0.60 % Status : Theorem % 0.21/0.60 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.12 v5.4.0, 0.13 v5.3.0, 0.17 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.33 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.21/0.60 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.21/0.60 % Number of atoms : 4 ( 0 equ) % 0.21/0.60 % Maximal formula atoms : 4 ( 4 avg) % 0.21/0.60 % Number of connectives : 3 ( 0 ~; 0 |; 0 &) % 0.21/0.60 % ( 3 <=>; 0 =>; 0 <=; 0 <~>) % 0.21/0.60 % Maximal formula depth : 5 ( 5 avg) % 0.21/0.60 % Maximal term depth : 1 ( 1 avg) % 0.21/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.21/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.21/0.60 % Number of variables : 4 ( 2 !; 2 ?) % 0.21/0.60 % SPC : FOF_THM_RFO_NEQ % 0.21/0.60 % 0.21/0.60 % Comments : % 0.21/0.60 %-------------------------------------------------------------------------- % 0.21/0.60 fof(x2125,conjecture, % 0.21/0.60 ( ? [X] : % 0.21/0.60 ! [Y] : % 0.21/0.60 ( big_p(X) % 0.21/0.60 <=> big_p(Y) ) % 0.21/0.60 <=> ( ? [X] : big_p(X) % 0.21/0.60 <=> ! [Y] : big_p(Y) ) ) ). % 0.21/0.60 % 0.21/0.60 %-------------------------------------------------------------------------- % 0.21/0.60 %------------------------------------------- % 0.21/0.60 % Proof found % 0.21/0.60 % SZS status Theorem for theBenchmark % 0.21/0.60 % SZS output start Proof % 0.56/0.60 %ClaNum:8(EqnAxiom:0) % 0.56/0.60 %VarNum:18(SingletonVarNum:14) % 0.56/0.60 %MaxLitNum:4 % 0.56/0.60 %MaxfuncDepth:1 % 0.56/0.60 %SharedTerms:11 % 0.56/0.60 %goalClause: 3 4 5 6 7 8 % 0.56/0.60 [5]P1(x51)+P1(x52)+P1(a3)+P1(f4(x51)) % 0.56/0.60 [6]P1(x61)+~P1(x62)+P1(f4(x61))+~P1(a5) % 0.56/0.60 [7]P1(x71)+~P1(x72)+P1(a3)+~P1(f4(x72)) % 0.56/0.60 [8]~P1(x81)+~P1(x82)+~P1(a5)+~P1(f4(x81)) % 0.56/0.60 [3]P1(x31)+P1(x32)+~P1(x33)+~P1(a2) % 0.56/0.60 [4]P1(x41)+~P1(x42)+~P1(x43)+P1(a2) % 0.56/0.60 %EqnAxiom % 0.56/0.60 % 0.56/0.60 %------------------------------------------- % 0.56/0.61 cnf(9,plain, % 0.56/0.61 (P1(x91)+P1(x92)+~P1(a2)), % 0.56/0.61 inference(factoring_inference,[],[3])). % 0.56/0.61 cnf(10,plain, % 0.56/0.61 (P1(a2)+~P1(x101)+~P1(x102)), % 0.56/0.61 inference(factoring_inference,[],[4])). % 0.56/0.61 cnf(11,plain, % 0.56/0.61 (P1(x111)+P1(a3)+P1(f4(x111))), % 0.56/0.61 inference(factoring_inference,[],[5])). % 0.56/0.61 cnf(14,plain, % 0.56/0.61 (~P1(x141)+~P1(a5)+~P1(f4(x141))), % 0.56/0.61 inference(factoring_inference,[],[8])). % 0.56/0.61 cnf(15,plain, % 0.56/0.61 (~P1(f4(a5))+~P1(a2)), % 0.56/0.61 inference(scs_inference,[],[9,14])). % 0.56/0.61 cnf(16,plain, % 0.56/0.61 (~P1(a2)), % 0.56/0.61 inference(scs_inference,[],[15,9])). % 0.56/0.61 cnf(17,plain, % 0.56/0.61 (~P1(x171)+~P1(x172)), % 0.56/0.61 inference(scs_inference,[],[16,10])). % 0.56/0.61 cnf(18,plain, % 0.56/0.61 (P1(a3)), % 0.56/0.61 inference(scs_inference,[],[16,17,11])). % 0.56/0.61 cnf(20,plain, % 0.56/0.61 ($false), % 0.56/0.61 inference(scs_inference,[],[18,17]), % 0.56/0.61 ['proof']). % 0.56/0.61 % SZS output end Proof % 0.56/0.61 % Total time :0.000000s %------------------------------------------------------------------------------