0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : run_vampire %s %d 0.14/0.34 % Computer : n026.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Thu Jul 2 07:03:54 EDT 2020 0.14/0.34 % CPUTime : 0.22/0.48 % (32254)dis+1011_24_add=large:afr=on:afp=4000:afq=1.0:anc=none:bs=unit_only:bce=on:cond=fast:gs=on:nm=32:nwc=2.5:nicw=on:sp=occurrence:updr=off_4 on theBenchmark 0.22/0.49 % (32254)Refutation found. Thanks to Tanya! 0.22/0.49 % SZS status Theorem for theBenchmark 0.22/0.50 % (32262)dis+11_3:1_add=off:afr=on:afp=100000:afq=1.2:amm=off:anc=none:bd=off:bs=unit_only:irw=on:lcm=predicate:lma=on:nm=2:nwc=1:sd=2:ss=axioms:sos=all:sp=occurrence:updr=off_1 on theBenchmark 0.22/0.50 % (32262)Refutation not found, incomplete strategy% (32262)------------------------------ 0.22/0.50 % (32262)Version: Vampire 4.5.0 (commit 2ee491ce on 2020-06-19 13:55:12 +0100) 0.22/0.50 % (32262)Termination reason: Refutation not found, incomplete strategy 0.22/0.50 0.22/0.50 % (32262)Memory used [KB]: 6140 0.22/0.50 % (32262)Time elapsed: 0.078 s 0.22/0.50 % (32262)------------------------------ 0.22/0.50 % (32262)------------------------------ 0.22/0.50 % SZS output start Proof for theBenchmark 0.22/0.50 fof(f963,plain,( 0.22/0.50 $false), 0.22/0.50 inference(subsumption_resolution,[],[f962,f715])). 0.22/0.50 fof(f715,plain,( 0.22/0.50 is_a_theorem(sK33)), 0.22/0.50 inference(global_subsumption,[],[f325,f404])). 0.22/0.50 fof(f404,plain,( 0.22/0.50 modus_ponens_strict_implies | is_a_theorem(sK33)), 0.22/0.50 inference(cnf_transformation,[],[f200])). 0.22/0.50 fof(f200,plain,( 0.22/0.50 (modus_ponens_strict_implies | (~is_a_theorem(sK34) & is_a_theorem(sK33) & is_a_theorem(strict_implies(sK33,sK34)))) & (! [X2,X3] : (is_a_theorem(X3) | ~is_a_theorem(X2) | ~is_a_theorem(strict_implies(X2,X3))) | ~modus_ponens_strict_implies)), 0.22/0.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK33,sK34])],[f198,f199])). 0.22/0.50 fof(f199,plain,( 0.22/0.50 ? [X0,X1] : (~is_a_theorem(X1) & is_a_theorem(X0) & is_a_theorem(strict_implies(X0,X1))) => (~is_a_theorem(sK34) & is_a_theorem(sK33) & is_a_theorem(strict_implies(sK33,sK34)))), 0.22/0.50 introduced(choice_axiom,[])). 0.22/0.50 fof(f198,plain,( 0.22/0.50 (modus_ponens_strict_implies | ? [X0,X1] : (~is_a_theorem(X1) & is_a_theorem(X0) & is_a_theorem(strict_implies(X0,X1)))) & (! [X2,X3] : (is_a_theorem(X3) | ~is_a_theorem(X2) | ~is_a_theorem(strict_implies(X2,X3))) | ~modus_ponens_strict_implies)), 0.22/0.50 inference(rectify,[],[f197])). 0.22/0.50 fof(f197,plain,( 0.22/0.50 (modus_ponens_strict_implies | ? [X0,X1] : (~is_a_theorem(X1) & is_a_theorem(X0) & is_a_theorem(strict_implies(X0,X1)))) & (! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(X0) | ~is_a_theorem(strict_implies(X0,X1))) | ~modus_ponens_strict_implies)), 0.22/0.50 inference(nnf_transformation,[],[f124])). 0.22/0.50 fof(f124,plain,( 0.22/0.50 modus_ponens_strict_implies <=> ! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(X0) | ~is_a_theorem(strict_implies(X0,X1)))), 0.22/0.50 inference(flattening,[],[f123])). 0.22/0.50 fof(f123,plain,( 0.22/0.50 modus_ponens_strict_implies <=> ! [X0,X1] : (is_a_theorem(X1) | (~is_a_theorem(X0) | ~is_a_theorem(strict_implies(X0,X1))))), 0.22/0.50 inference(ennf_transformation,[],[f72])). 0.22/0.50 fof(f72,axiom,( 0.22/0.50 modus_ponens_strict_implies <=> ! [X0,X1] : ((is_a_theorem(X0) & is_a_theorem(strict_implies(X0,X1))) => is_a_theorem(X1))), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens_strict_implies)). 0.22/0.50 fof(f325,plain,( 0.22/0.50 ~modus_ponens_strict_implies), 0.22/0.50 inference(cnf_transformation,[],[f91])). 0.22/0.50 fof(f91,plain,( 0.22/0.50 ~modus_ponens_strict_implies), 0.22/0.50 inference(flattening,[],[f89])). 0.22/0.50 fof(f89,negated_conjecture,( 0.22/0.50 ~modus_ponens_strict_implies), 0.22/0.50 inference(negated_conjecture,[],[f88])). 0.22/0.50 fof(f88,conjecture,( 0.22/0.50 modus_ponens_strict_implies), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies)). 0.22/0.50 fof(f962,plain,( 0.22/0.50 ~is_a_theorem(sK33)), 0.22/0.50 inference(subsumption_resolution,[],[f961,f714])). 0.22/0.50 fof(f714,plain,( 0.22/0.50 ~is_a_theorem(sK34)), 0.22/0.50 inference(global_subsumption,[],[f325,f405])). 0.22/0.50 fof(f405,plain,( 0.22/0.50 modus_ponens_strict_implies | ~is_a_theorem(sK34)), 0.22/0.50 inference(cnf_transformation,[],[f200])). 0.22/0.50 fof(f961,plain,( 0.22/0.50 is_a_theorem(sK34) | ~is_a_theorem(sK33)), 0.22/0.50 inference(resolution,[],[f960,f849])). 0.22/0.50 fof(f849,plain,( 0.22/0.50 ( ! [X0,X1] : (~is_a_theorem(implies(X0,X1)) | is_a_theorem(X1) | ~is_a_theorem(X0)) )), 0.22/0.50 inference(global_subsumption,[],[f333,f463])). 0.22/0.50 fof(f463,plain,( 0.22/0.50 ( ! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0) | ~modus_ponens) )), 0.22/0.50 inference(cnf_transformation,[],[f308])). 0.22/0.50 fof(f308,plain,( 0.22/0.50 (! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0)) | ~modus_ponens) & (modus_ponens | (~is_a_theorem(sK81) & is_a_theorem(implies(sK80,sK81)) & is_a_theorem(sK80)))), 0.22/0.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK80,sK81])],[f306,f307])). 0.22/0.50 fof(f307,plain,( 0.22/0.50 ? [X2,X3] : (~is_a_theorem(X3) & is_a_theorem(implies(X2,X3)) & is_a_theorem(X2)) => (~is_a_theorem(sK81) & is_a_theorem(implies(sK80,sK81)) & is_a_theorem(sK80))), 0.22/0.50 introduced(choice_axiom,[])). 0.22/0.50 fof(f306,plain,( 0.22/0.50 (! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0)) | ~modus_ponens) & (modus_ponens | ? [X2,X3] : (~is_a_theorem(X3) & is_a_theorem(implies(X2,X3)) & is_a_theorem(X2)))), 0.22/0.50 inference(rectify,[],[f305])). 0.22/0.50 fof(f305,plain,( 0.22/0.50 (! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0)) | ~modus_ponens) & (modus_ponens | ? [X0,X1] : (~is_a_theorem(X1) & is_a_theorem(implies(X0,X1)) & is_a_theorem(X0)))), 0.22/0.50 inference(nnf_transformation,[],[f128])). 0.22/0.50 fof(f128,plain,( 0.22/0.50 ! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0)) <=> modus_ponens), 0.22/0.50 inference(flattening,[],[f127])). 0.22/0.50 fof(f127,plain,( 0.22/0.50 ! [X0,X1] : (is_a_theorem(X1) | (~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0))) <=> modus_ponens), 0.22/0.50 inference(ennf_transformation,[],[f24])). 0.22/0.50 fof(f24,axiom,( 0.22/0.50 ! [X0,X1] : ((is_a_theorem(implies(X0,X1)) & is_a_theorem(X0)) => is_a_theorem(X1)) <=> modus_ponens), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens)). 0.22/0.50 fof(f333,plain,( 0.22/0.50 modus_ponens), 0.22/0.50 inference(cnf_transformation,[],[f46])). 0.22/0.50 fof(f46,axiom,( 0.22/0.50 modus_ponens), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens)). 0.22/0.50 fof(f960,plain,( 0.22/0.50 is_a_theorem(implies(sK33,sK34))), 0.22/0.50 inference(resolution,[],[f922,f716])). 0.22/0.50 fof(f716,plain,( 0.22/0.50 is_a_theorem(strict_implies(sK33,sK34))), 0.22/0.50 inference(global_subsumption,[],[f325,f403])). 0.22/0.50 fof(f403,plain,( 0.22/0.50 modus_ponens_strict_implies | is_a_theorem(strict_implies(sK33,sK34))), 0.22/0.50 inference(cnf_transformation,[],[f200])). 0.22/0.50 fof(f922,plain,( 0.22/0.50 ( ! [X0,X1] : (~is_a_theorem(strict_implies(X0,X1)) | is_a_theorem(implies(X0,X1))) )), 0.22/0.50 inference(superposition,[],[f919,f472])). 0.22/0.50 fof(f472,plain,( 0.22/0.50 ( ! [X0,X1] : (necessarily(implies(X0,X1)) = strict_implies(X0,X1)) )), 0.22/0.50 inference(global_subsumption,[],[f348,f359])). 0.22/0.50 fof(f359,plain,( 0.22/0.50 ( ! [X0,X1] : (necessarily(implies(X0,X1)) = strict_implies(X0,X1) | ~op_strict_implies) )), 0.22/0.50 inference(cnf_transformation,[],[f114])). 0.22/0.50 fof(f114,plain,( 0.22/0.50 ! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(X0,X1) | ~op_strict_implies), 0.22/0.50 inference(ennf_transformation,[],[f74])). 0.22/0.50 fof(f74,axiom,( 0.22/0.50 op_strict_implies => ! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(X0,X1)), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies)). 0.22/0.50 fof(f348,plain,( 0.22/0.50 op_strict_implies), 0.22/0.50 inference(cnf_transformation,[],[f87])). 0.22/0.50 fof(f87,axiom,( 0.22/0.50 op_strict_implies), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies)). 0.22/0.50 fof(f919,plain,( 0.22/0.50 ( ! [X17] : (~is_a_theorem(necessarily(X17)) | is_a_theorem(X17)) )), 0.22/0.50 inference(resolution,[],[f849,f733])). 0.22/0.50 fof(f733,plain,( 0.22/0.50 ( ! [X0] : (is_a_theorem(implies(necessarily(X0),X0))) )), 0.22/0.50 inference(global_subsumption,[],[f331,f422])). 0.22/0.50 fof(f422,plain,( 0.22/0.50 ( ! [X0] : (is_a_theorem(implies(necessarily(X0),X0)) | ~axiom_M) )), 0.22/0.50 inference(cnf_transformation,[],[f232])). 0.22/0.50 fof(f232,plain,( 0.22/0.50 (! [X0] : is_a_theorem(implies(necessarily(X0),X0)) | ~axiom_M) & (axiom_M | ~is_a_theorem(implies(necessarily(sK50),sK50)))), 0.22/0.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK50])],[f230,f231])). 0.22/0.50 fof(f231,plain,( 0.22/0.50 ? [X1] : ~is_a_theorem(implies(necessarily(X1),X1)) => ~is_a_theorem(implies(necessarily(sK50),sK50))), 0.22/0.50 introduced(choice_axiom,[])). 0.22/0.50 fof(f230,plain,( 0.22/0.50 (! [X0] : is_a_theorem(implies(necessarily(X0),X0)) | ~axiom_M) & (axiom_M | ? [X1] : ~is_a_theorem(implies(necessarily(X1),X1)))), 0.22/0.50 inference(rectify,[],[f229])). 0.22/0.50 fof(f229,plain,( 0.22/0.50 (! [X0] : is_a_theorem(implies(necessarily(X0),X0)) | ~axiom_M) & (axiom_M | ? [X0] : ~is_a_theorem(implies(necessarily(X0),X0)))), 0.22/0.50 inference(nnf_transformation,[],[f53])). 0.22/0.50 fof(f53,axiom,( 0.22/0.50 ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) <=> axiom_M), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_M)). 0.22/0.50 fof(f331,plain,( 0.22/0.50 axiom_M), 0.22/0.50 inference(cnf_transformation,[],[f77])). 0.22/0.50 fof(f77,axiom,( 0.22/0.50 axiom_M), 0.22/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km4b_axiom_M)). 0.22/0.50 % SZS output end Proof for theBenchmark 0.22/0.50 % (32254)------------------------------ 0.22/0.50 % (32254)Version: Vampire 4.5.0 (commit 2ee491ce on 2020-06-19 13:55:12 +0100) 0.22/0.50 % (32254)Termination reason: Refutation 0.22/0.50 0.22/0.50 % (32254)Memory used [KB]: 11385 0.22/0.50 % (32254)Time elapsed: 0.074 s 0.22/0.50 % (32254)------------------------------ 0.22/0.50 % (32254)------------------------------ 0.22/0.50 % (32245)Success in time 0.141 s 0.22/0.51 EOF