TSTP Solution File: SYN349-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN349-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:30:14 EDT 2024
% Result : Unsatisfiable 1.81s 1.19s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 1 unt; 10 nHn; 22 RR)
% Number of literals : 73 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
( ~ f(w(X0),g(X0,X1))
| f(X0,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(c_50,negated_conjecture,
( ~ f(X0,g(X0,X1))
| f(w(X0),g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(c_51,negated_conjecture,
( ~ f(X0,g(X0,X1))
| ~ f(X1,g(X0,X1))
| f(g(X0,X1),w(X0))
| f(g(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(c_53,negated_conjecture,
( f(g(X0,X1),w(X0))
| f(g(X0,X1),X1)
| f(X0,g(X0,X1))
| f(X1,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(c_56,negated_conjecture,
( ~ f(g(X0,X1),w(X0))
| ~ f(g(X0,X1),X1)
| f(X0,g(X0,X1))
| f(X1,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
cnf(c_58,negated_conjecture,
( ~ f(g(X0,X1),w(X0))
| ~ f(g(X0,X1),X1)
| ~ f(X0,g(X0,X1))
| ~ f(X1,g(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).
cnf(c_153,negated_conjecture,
( ~ f(g(X0,X1),w(X0))
| ~ f(g(X0,X1),X1)
| ~ f(X0,g(X0,X1))
| ~ f(X1,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_155,negated_conjecture,
( ~ f(g(X0,X1),w(X0))
| ~ f(g(X0,X1),X1)
| f(X0,g(X0,X1))
| f(X1,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_158,negated_conjecture,
( f(g(X0,X1),w(X0))
| f(g(X0,X1),X1)
| f(X0,g(X0,X1))
| f(X1,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_160,negated_conjecture,
( ~ f(X0,g(X0,X1))
| ~ f(X1,g(X0,X1))
| f(g(X0,X1),w(X0))
| f(g(X0,X1),X1) ),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_161,negated_conjecture,
( ~ f(X0,g(X0,X1))
| f(w(X0),g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_162,negated_conjecture,
( ~ f(w(X0),g(X0,X1))
| f(X0,g(X0,X1)) ),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_163,plain,
( ~ f(w(X0),g(X0,w(X0)))
| ~ f(X0,g(X0,w(X0)))
| f(g(X0,w(X0)),w(X0)) ),
inference(instantiation,[status(thm)],[c_160]) ).
cnf(c_164,plain,
( ~ f(g(X0,w(X0)),w(X0))
| ~ f(w(X0),g(X0,w(X0)))
| ~ f(X0,g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_165,plain,
( ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| ~ f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| f(g(iProver_bot,w(iProver_bot)),w(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_166,plain,
( ~ f(g(iProver_bot,w(iProver_bot)),w(iProver_bot))
| ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| ~ f(iProver_bot,g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_164]) ).
cnf(c_169,plain,
( f(g(X0,w(X0)),w(X0))
| f(w(X0),g(X0,w(X0)))
| f(X0,g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_170,plain,
( ~ f(g(X0,w(X0)),w(X0))
| f(w(X0),g(X0,w(X0)))
| f(X0,g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_172,plain,
( ~ f(w(X0),g(X0,w(X0)))
| f(X0,g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_162]) ).
cnf(c_173,plain,
( ~ f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| f(iProver_bot,g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_172]) ).
cnf(c_174,plain,
( ~ f(g(iProver_bot,w(iProver_bot)),w(iProver_bot))
| f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| f(iProver_bot,g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_170]) ).
cnf(c_175,plain,
( f(g(iProver_bot,w(iProver_bot)),w(iProver_bot))
| f(w(iProver_bot),g(iProver_bot,w(iProver_bot)))
| f(iProver_bot,g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_169]) ).
cnf(c_176,plain,
( ~ f(X0,g(X0,w(X0)))
| f(w(X0),g(X0,w(X0))) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_177,plain,
( ~ f(iProver_bot,g(iProver_bot,w(iProver_bot)))
| f(w(iProver_bot),g(iProver_bot,w(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_176]) ).
cnf(c_180,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_177,c_175,c_174,c_173,c_166,c_165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN349-1 : TPTP v8.1.2. Released v1.2.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:40:16 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.81/1.19 % SZS status Started for theBenchmark.p
% 1.81/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.19
% 1.81/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.81/1.19
% 1.81/1.19 ------ iProver source info
% 1.81/1.19
% 1.81/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.81/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.81/1.19 git: non_committed_changes: false
% 1.81/1.19
% 1.81/1.19 ------ Parsing...successful
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.81/1.19
% 1.81/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.81/1.19 ------ Proving...
% 1.81/1.19 ------ Problem Properties
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19 clauses 10
% 1.81/1.19 conjectures 10
% 1.81/1.19 EPR 0
% 1.81/1.19 Horn 3
% 1.81/1.19 unary 0
% 1.81/1.19 binary 2
% 1.81/1.19 lits 36
% 1.81/1.19 lits eq 0
% 1.81/1.19 fd_pure 0
% 1.81/1.19 fd_pseudo 0
% 1.81/1.19 fd_cond 0
% 1.81/1.19 fd_pseudo_cond 0
% 1.81/1.19 AC symbols 0
% 1.81/1.19
% 1.81/1.19 ------ Schedule dynamic 5 is on
% 1.81/1.19
% 1.81/1.19 ------ no equalities: superposition off
% 1.81/1.19
% 1.81/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19 ------
% 1.81/1.19 Current options:
% 1.81/1.19 ------
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19 ------ Proving...
% 1.81/1.19
% 1.81/1.19
% 1.81/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.19
% 1.81/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.19
% 1.81/1.19
%------------------------------------------------------------------------------