TSTP Solution File: RNG045+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG045+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 02:57:23 EDT 2024
% Result : Theorem 6.62s 1.69s
% Output : CNFRefutation 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 21 unt; 0 def)
% Number of atoms : 90 ( 53 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 96 ( 46 ~; 41 |; 8 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDistr) ).
fof(f16,axiom,
( aScalar0(xv)
& aScalar0(xu)
& aScalar0(xy)
& aScalar0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__674) ).
fof(f17,axiom,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__733) ).
fof(f18,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(negated_conjecture,[],[f18]) ).
fof(f23,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(flattening,[],[f19]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f38]) ).
fof(f64,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
aScalar0(xx),
inference(cnf_transformation,[],[f16]) ).
fof(f67,plain,
aScalar0(xy),
inference(cnf_transformation,[],[f16]) ).
fof(f68,plain,
aScalar0(xu),
inference(cnf_transformation,[],[f16]) ).
fof(f69,plain,
aScalar0(xv),
inference(cnf_transformation,[],[f16]) ).
fof(f70,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
inference(cnf_transformation,[],[f17]) ).
fof(f71,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(cnf_transformation,[],[f23]) ).
cnf(c_72,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) = sdtasdt0(X0,sdtpldt0(X1,X2)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_73,plain,
aScalar0(xv),
inference(cnf_transformation,[],[f69]) ).
cnf(c_74,plain,
aScalar0(xu),
inference(cnf_transformation,[],[f68]) ).
cnf(c_75,plain,
aScalar0(xy),
inference(cnf_transformation,[],[f67]) ).
cnf(c_76,plain,
aScalar0(xx),
inference(cnf_transformation,[],[f66]) ).
cnf(c_77,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnf_transformation,[],[f70]) ).
cnf(c_78,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnf_transformation,[],[f71]) ).
cnf(c_249,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(subtyping,[status(esa)],[c_78]) ).
cnf(c_250,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(subtyping,[status(esa)],[c_77]) ).
cnf(c_255,plain,
( ~ aScalar0(X0_13)
| ~ aScalar0(X1_13)
| ~ aScalar0(X2_13)
| sdtpldt0(sdtasdt0(X0_13,X1_13),sdtasdt0(X0_13,X2_13)) = sdtasdt0(X0_13,sdtpldt0(X1_13,X2_13)) ),
inference(subtyping,[status(esa)],[c_72]) ).
cnf(c_284,plain,
X0_13 = X0_13,
theory(equality) ).
cnf(c_286,plain,
( X0_13 != X1_13
| X2_13 != X1_13
| X2_13 = X0_13 ),
theory(equality) ).
cnf(c_291,plain,
( X0_13 != X1_13
| X2_13 != X3_13
| sdtpldt0(X0_13,X2_13) = sdtpldt0(X1_13,X3_13) ),
theory(equality) ).
cnf(c_835,plain,
( sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != X0_13
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != X0_13
| sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) ),
inference(instantiation,[status(thm)],[c_286]) ).
cnf(c_842,plain,
( sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != X0_13
| X1_13 != X0_13
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = X1_13 ),
inference(instantiation,[status(thm)],[c_286]) ).
cnf(c_912,plain,
( sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| X0_13 != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = X0_13 ),
inference(instantiation,[status(thm)],[c_842]) ).
cnf(c_913,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(instantiation,[status(thm)],[c_284]) ).
cnf(c_1141,plain,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) ),
inference(instantiation,[status(thm)],[c_912]) ).
cnf(c_1326,plain,
( sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)) != X0_13
| sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)) != X1_13
| sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) = sdtpldt0(X1_13,X0_13) ),
inference(instantiation,[status(thm)],[c_291]) ).
cnf(c_1482,plain,
( sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))
| sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))
| sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) ),
inference(instantiation,[status(thm)],[c_835]) ).
cnf(c_2056,plain,
( sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)) != X0_13
| sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)) != sdtasdt0(xx,sdtpldt0(xu,xv))
| sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),X0_13) ),
inference(instantiation,[status(thm)],[c_1326]) ).
cnf(c_2057,plain,
( ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xx)
| sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)) = sdtasdt0(xx,sdtpldt0(xu,xv)) ),
inference(instantiation,[status(thm)],[c_255]) ).
cnf(c_3423,plain,
( ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xy)
| sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)) = sdtasdt0(xy,sdtpldt0(xu,xv)) ),
inference(instantiation,[status(thm)],[c_255]) ).
cnf(c_8085,plain,
( sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)) != sdtasdt0(xy,sdtpldt0(xu,xv))
| sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)) != sdtasdt0(xx,sdtpldt0(xu,xv))
| sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) ),
inference(instantiation,[status(thm)],[c_2056]) ).
cnf(c_8087,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8085,c_3423,c_2057,c_1482,c_1141,c_913,c_250,c_249,c_73,c_74,c_75,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG045+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:46:35 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 6.62/1.69 % SZS status Started for theBenchmark.p
% 6.62/1.69 % SZS status Theorem for theBenchmark.p
% 6.62/1.69
% 6.62/1.69 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 6.62/1.69
% 6.62/1.69 ------ iProver source info
% 6.62/1.69
% 6.62/1.69 git: date: 2024-05-02 19:28:25 +0000
% 6.62/1.69 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 6.62/1.69 git: non_committed_changes: false
% 6.62/1.69
% 6.62/1.69 ------ Parsing...
% 6.62/1.69 ------ Clausification by vclausify_rel & Parsing by iProver...
% 6.62/1.69
% 6.62/1.69 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 6.62/1.69
% 6.62/1.69 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 6.62/1.69
% 6.62/1.69 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 6.62/1.69 ------ Proving...
% 6.62/1.69 ------ Problem Properties
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69 clauses 33
% 6.62/1.69 conjectures 1
% 6.62/1.69 EPR 9
% 6.62/1.69 Horn 29
% 6.62/1.69 unary 9
% 6.62/1.69 binary 13
% 6.62/1.69 lits 75
% 6.62/1.69 lits eq 22
% 6.62/1.69 fd_pure 0
% 6.62/1.69 fd_pseudo 0
% 6.62/1.69 fd_cond 1
% 6.62/1.69 fd_pseudo_cond 1
% 6.62/1.69 AC symbols 0
% 6.62/1.69
% 6.62/1.69 ------ Input Options Time Limit: Unbounded
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69 ------
% 6.62/1.69 Current options:
% 6.62/1.69 ------
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69 ------ Proving...
% 6.62/1.69
% 6.62/1.69
% 6.62/1.69 % SZS status Theorem for theBenchmark.p
% 6.62/1.69
% 6.62/1.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.62/1.69
% 6.62/1.69
%------------------------------------------------------------------------------