0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_iprover 180 /export/starexec/sandbox2/benchmark/theBenchmark.p THM 0.10/0.36 % Computer : n007.cluster.edu 0.10/0.36 % Model : x86_64 x86_64 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.36 % Memory : 8046.5625MB 0.10/0.36 % OS : Linux 6.8.0-71-generic 0.10/0.36 % CPULimit : 1440 0.10/0.36 % WCLimit : 180 0.10/0.36 % DateTime : Mon Jul 27 08:54:33 UTC 2026 0.02/0.36 % CPUTime : 0.02/0.36 Running run_iprover 180 /export/starexec/sandbox2/benchmark/theBenchmark.p THM 0.02/0.39 /export/starexec/sandbox2/solver/bin/SPCForProblem: Command not found. 0.02/0.40 Running first-order theorem proving 0.02/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 180 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.02/0.41 0.02/0.41 % ======== iProver multi-core TPTP/SMT ========= 0.02/0.41 0.02/0.41 % Detected problem language: tptp 0.02/0.42 % Proving... 1.99/1.16 % SZS status Started for theBenchmark.p 1.99/1.16 % SZS status Theorem for theBenchmark.p 1.99/1.16 1.99/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------% 1.99/1.16 1.99/1.16 % ------ iProver source info 1.99/1.16 1.99/1.16 % git: date: 2026-07-19 20:42:38 +0200 1.99/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61 1.99/1.16 % git: non_committed_changes: false 1.99/1.16 1.99/1.16 % ------ Parsing... 1.99/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...% 1.99/1.16 1.99/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e % 1.99/1.16 1.99/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % 1.99/1.16 1.99/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 1.99/1.16 % ------ Proving... 1.99/1.16 % ------ Problem Properties 1.99/1.16 1.99/1.16 % 1.99/1.16 % clauses 39 1.99/1.16 % conjectures 0 1.99/1.16 % EPR 33 1.99/1.16 % Horn 33 1.99/1.16 % unary 24 1.99/1.16 % binary 4 1.99/1.16 % lits 68 1.99/1.16 % lits eq 32 1.99/1.16 % fd_pure 0 1.99/1.16 % fd_pseudo 0 1.99/1.16 % fd_cond 3 1.99/1.16 % fd_pseudo_cond 3 1.99/1.16 % AC symbols 0 1.99/1.16 1.99/1.16 % ------ Schedule dynamic 5 is on 1.99/1.16 1.99/1.16 % ------ no conjectures: strip conj schedule 1.99/1.16 1.99/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10. 1.99/1.16 1.99/1.16 1.99/1.16 % ------ 1.99/1.16 % Current options: 1.99/1.16 % ------ 1.99/1.16 1.99/1.16 1.99/1.16 % 1.99/1.16 1.99/1.16 % ------ Proving... 1.99/1.16 % 1.99/1.16 1.99/1.16 % SZS status Theorem for theBenchmark.p 1.99/1.16 1.99/1.16 % SZS output start CNFRefutation for theBenchmark.p 1.99/1.16 1.99/1.16 fof(f9,axiom,( 1.99/1.16 ! [X0,X1] : (less(X0,X1) => leq(X0,X1))), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq)). 1.99/1.16 1.99/1.16 fof(f52,axiom,( 1.99/1.16 ! [X0,X1,X2] : ((leq(X1,X0) & leq(X0,X2) & X1 != X0) <=> wf(lt,X0,X1,X2))), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+8.ax',wf_lt)). 1.99/1.16 1.99/1.16 fof(f55,axiom,( 1.99/1.16 less(v600,v1200)), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v1200)). 1.99/1.16 1.99/1.16 fof(f56,conjecture,( 1.99/1.16 wf(lt,v600,v0,v1200)), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl613)). 1.99/1.16 1.99/1.16 fof(f57,negated_conjecture,( 1.99/1.16 ~ wf(lt,v600,v0,v1200)), 1.99/1.16 inference(negated_conjecture,[status(cth)],[f56])). 1.99/1.16 1.99/1.16 fof(f58,axiom,( 1.99/1.16 v600 != v1200 & v1200 != v0 & v600 != v0), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct)). 1.99/1.16 1.99/1.16 fof(f59,axiom,( 1.99/1.16 less(v0,v600)), 1.99/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600)). 1.99/1.16 1.99/1.16 fof(f62,plain,( 1.99/1.16 ~wf(lt,v600,v0,v1200)), 1.99/1.16 inference(flattening,[],[f57])). 1.99/1.16 1.99/1.16 fof(f81,plain,( 1.99/1.16 ! [X0,X1] : (leq(X0,X1) | ~less(X0,X1))), 1.99/1.16 inference(ennf_transformation,[],[f9])). 1.99/1.16 1.99/1.16 fof(f104,plain,( 1.99/1.16 ! [X0,X1,X2] : (((leq(X1,X0) & leq(X0,X2) & X1 != X0) | ~wf(lt,X0,X1,X2)) & (wf(lt,X0,X1,X2) | (~leq(X1,X0) | ~leq(X0,X2) | X0 = X1)))), 1.99/1.16 inference(nnf_transformation,[],[f52])). 1.99/1.16 1.99/1.16 fof(f105,plain,( 1.99/1.16 ! [X0,X1,X2] : (((leq(X1,X0) & leq(X0,X2) & X1 != X0) | ~wf(lt,X0,X1,X2)) & (wf(lt,X0,X1,X2) | ~leq(X1,X0) | ~leq(X0,X2) | X0 = X1))), 1.99/1.16 inference(flattening,[],[f104])). 1.99/1.16 1.99/1.16 fof(f116,plain,( 1.99/1.16 ( ! [X0,X1] : (leq(X0,X1) | ~less(X0,X1)) )), 1.99/1.16 inference(cnf_transformation,[],[f81])). 1.99/1.16 1.99/1.16 fof(f158,plain,( 1.99/1.16 ( ! [X2,X0,X1] : (wf(lt,X0,X1,X2) | ~leq(X1,X0) | ~leq(X0,X2) | X0 = X1) )), 1.99/1.16 inference(cnf_transformation,[],[f105])). 1.99/1.16 1.99/1.16 fof(f163,plain,( 1.99/1.16 less(v600,v1200)), 1.99/1.16 inference(cnf_transformation,[],[f55])). 1.99/1.16 1.99/1.16 fof(f164,plain,( 1.99/1.16 ~wf(lt,v600,v0,v1200)), 1.99/1.16 inference(cnf_transformation,[],[f62])). 1.99/1.16 1.99/1.16 fof(f165,plain,( 1.99/1.16 v600 != v0), 1.99/1.16 inference(cnf_transformation,[],[f58])). 1.99/1.16 1.99/1.16 fof(f168,plain,( 1.99/1.16 less(v0,v600)), 1.99/1.16 inference(cnf_transformation,[],[f59])). 1.99/1.16 1.99/1.16 tcf(c_59,plain,![X0:$i,X1:$i]: 1.99/1.16 (~less(X0,X1)|leq(X0,X1)), 1.99/1.16 inference(cnf_transformation,[],[f116])). 1.99/1.16 1.99/1.16 tcf(c_104,plain,![X0:$i,X1:$i,X2:$i]: 1.99/1.16 (~leq(X0,X1)|~leq(X2,X0)|X0 = X2|wf(lt,X0,X2,X1)), 1.99/1.16 inference(cnf_transformation,[],[f158])). 1.99/1.16 1.99/1.16 tcf(c_106,plain, (less(v600,v1200)),inference(cnf_transformation,[],[f163])). 1.99/1.16 1.99/1.16 tcf(c_107,negated_conjecture, 1.99/1.16 (~wf(lt,v600,v0,v1200)), 1.99/1.16 inference(cnf_transformation,[],[f164])). 1.99/1.16 1.99/1.16 tcf(c_110,plain, (v600 != v0),inference(cnf_transformation,[],[f165])). 1.99/1.16 1.99/1.16 tcf(c_111,plain, (less(v0,v600)),inference(cnf_transformation,[],[f168])). 1.99/1.16 1.99/1.16 tcf(c_688,plain,![X0:$i,X1:$i,X2:$i]: 1.99/1.16 (X0 != v600|X1 != v1200|X2 != v0|lt != lt|~leq(X0,X1)|~leq(X2,X0)| 1.99/1.16 X0 = X2), 1.99/1.16 inference(resolution_lifted,[status(thm)],[c_104,c_107])). 1.99/1.16 1.99/1.16 tcf(c_689,plain, 1.99/1.16 (~leq(v600,v1200)|~leq(v0,v600)|v600 = v0), 1.99/1.16 inference(unflattening,[status(thm)],[c_688])). 1.99/1.16 1.99/1.16 tcf(c_690,plain, 1.99/1.16 (~leq(v0,v600)|~leq(v600,v1200)), 1.99/1.16 inference(global_subsumption_just,[status(thm)],[c_689,c_110,c_689])). 1.99/1.16 1.99/1.16 tcf(c_691,plain, 1.99/1.16 (~leq(v600,v1200)|~leq(v0,v600)), 1.99/1.16 inference(renaming,[status(thm)],[c_690])). 1.99/1.16 1.99/1.16 tcf(c_929,plain, 1.99/1.16 (~leq(v600,v1200)|~leq(v0,v600)), 1.99/1.16 inference(demodulation,[status(thm)],[c_691])). 1.99/1.16 1.99/1.16 tcf(c_1306,plain, 1.99/1.16 (leq(v600,v1200)), 1.99/1.16 inference(superposition,[status(thm)],[c_106,c_59])). 1.99/1.16 1.99/1.16 tcf(c_1307,plain, 1.99/1.16 (leq(v0,v600)), 1.99/1.16 inference(superposition,[status(thm)],[c_111,c_59])). 1.99/1.16 1.99/1.16 tcf(c_1308,plain, 1.99/1.16 (~leq(v0,v600)), 1.99/1.16 inference(backward_subsumption_resolution,[status(thm)],[c_929,c_1306])). 1.99/1.16 1.99/1.16 tcf(c_1309,plain, 1.99/1.16 ($false), 1.99/1.16 inference(forward_subsumption_resolution,[status(thm)],[c_1308,c_1307])). 1.99/1.16 1.99/1.16 1.99/1.16 % SZS output end CNFRefutation for theBenchmark.p 1.99/1.16 1.99/1.16 2.01/1.29 EOF