TSTP Solution File: SWV009-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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 : Fri May 3 03:13:16 EDT 2024
% Result : Unsatisfiable 0.47s 1.17s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(c_51,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(c_52,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(c_53,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(c_54,negated_conjecture,
( ~ less_or_equal(X0,n)
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X0)
| less_or_equal(a(X1),a(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(c_55,negated_conjecture,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(m,X0)
| less_or_equal(a(X0),a(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(c_56,negated_conjecture,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(i,X0)
| less_or_equal(a(X0),a(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(c_57,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(c_102,plain,
a(p) = sP0_iProver_def,
definition ).
cnf(c_103,plain,
a(q) = sP1_iProver_def,
definition ).
cnf(c_104,negated_conjecture,
~ less_or_equal(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_57,c_103,c_102]) ).
cnf(c_105,negated_conjecture,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(i,X0)
| less_or_equal(a(X0),a(X1)) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_106,negated_conjecture,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(m,X0)
| less_or_equal(a(X0),a(X1)) ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_107,negated_conjecture,
( ~ less_or_equal(X0,n)
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X0)
| less_or_equal(a(X1),a(X0)) ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_108,negated_conjecture,
less_or_equal(q,n),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_109,negated_conjecture,
less_or_equal(p,q),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_110,negated_conjecture,
less_or_equal(m,p),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_112,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_286,plain,
( ~ less_or_equal(X0,j)
| ~ less_or_equal(p,X0)
| ~ less_or_equal(m,p)
| less_or_equal(sP0_iProver_def,a(X0)) ),
inference(superposition,[status(thm)],[c_102,c_106]) ).
cnf(c_302,plain,
( ~ less_or_equal(X0,j)
| ~ less_or_equal(p,X0)
| less_or_equal(sP0_iProver_def,a(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_286,c_110]) ).
cnf(c_313,plain,
( ~ less_or_equal(X0,q)
| ~ less_or_equal(i,X0)
| ~ less_or_equal(q,n)
| less_or_equal(a(X0),sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_103,c_105]) ).
cnf(c_314,plain,
( ~ less_or_equal(X0,q)
| ~ less_or_equal(i,X0)
| less_or_equal(a(X0),sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_313,c_108]) ).
cnf(c_347,plain,
( ~ less_or_equal(m,X0)
| ~ less(X0,i)
| ~ less_or_equal(q,n)
| ~ less(j,q)
| less_or_equal(a(X0),sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_103,c_107]) ).
cnf(c_348,plain,
( ~ less_or_equal(m,X0)
| ~ less(X0,i)
| ~ less(j,q)
| less_or_equal(a(X0),sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_347,c_108]) ).
cnf(c_379,plain,
( ~ less_or_equal(p,q)
| ~ less_or_equal(q,j)
| less_or_equal(sP0_iProver_def,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_103,c_302]) ).
cnf(c_380,plain,
~ less_or_equal(q,j),
inference(forward_subsumption_resolution,[status(thm)],[c_379,c_104,c_109]) ).
cnf(c_396,plain,
( ~ less_or_equal(i,p)
| ~ less_or_equal(p,q)
| less_or_equal(sP0_iProver_def,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_102,c_314]) ).
cnf(c_401,plain,
~ less_or_equal(i,p),
inference(forward_subsumption_resolution,[status(thm)],[c_396,c_104,c_109]) ).
cnf(c_474,plain,
( ~ less_or_equal(m,p)
| ~ less(j,q)
| ~ less(p,i)
| less_or_equal(sP0_iProver_def,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_102,c_348]) ).
cnf(c_480,plain,
( ~ less(j,q)
| ~ less(p,i) ),
inference(forward_subsumption_resolution,[status(thm)],[c_474,c_104,c_110]) ).
cnf(c_487,plain,
( ~ less(j,q)
| less_or_equal(i,p) ),
inference(superposition,[status(thm)],[c_112,c_480]) ).
cnf(c_488,plain,
~ less(j,q),
inference(forward_subsumption_resolution,[status(thm)],[c_487,c_401]) ).
cnf(c_507,plain,
less_or_equal(q,j),
inference(superposition,[status(thm)],[c_112,c_488]) ).
cnf(c_508,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_507,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n010.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 : Fri May 3 00:16:34 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.17 % SZS status Started for theBenchmark.p
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.17
% 0.47/1.17 ------ iProver source info
% 0.47/1.17
% 0.47/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.17 git: non_committed_changes: false
% 0.47/1.17
% 0.47/1.17 ------ Parsing...successful
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.17 ------ Proving...
% 0.47/1.17 ------ Problem Properties
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 clauses 11
% 0.47/1.17 conjectures 9
% 0.47/1.17 EPR 6
% 0.47/1.17 Horn 10
% 0.47/1.17 unary 7
% 0.47/1.17 binary 1
% 0.47/1.17 lits 22
% 0.47/1.17 lits eq 2
% 0.47/1.17 fd_pure 0
% 0.47/1.17 fd_pseudo 0
% 0.47/1.17 fd_cond 0
% 0.47/1.17 fd_pseudo_cond 0
% 0.47/1.17 AC symbols 0
% 0.47/1.17
% 0.47/1.17 ------ Schedule dynamic 5 is on
% 0.47/1.17
% 0.47/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------
% 0.47/1.17 Current options:
% 0.47/1.17 ------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Proving...
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.17
% 0.47/1.17
%------------------------------------------------------------------------------