TSTP Solution File: RNG059+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG059+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Thu Aug 31 13:54:58 EDT 2023
% Result : Theorem 3.03s 1.21s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 21 unt; 0 def)
% Number of atoms : 114 ( 56 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 125 ( 60 ~; 45 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
aScalar0(sz0z00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSZeroSc) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mArith) ).
fof(f17,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> ( smndt0(sdtasdt0(X0,X1)) = sdtasdt0(smndt0(X0),X1)
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMNeg) ).
fof(f52,axiom,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(f54,axiom,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(f55,axiom,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1949) ).
fof(f58,conjecture,
sdtasdt0(smndt0(xS),xR) = smndt0(xN),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f59,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(negated_conjecture,[],[f58]) ).
fof(f65,plain,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(flattening,[],[f59]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f78]) ).
fof(f84,plain,
! [X0,X1] :
( ( smndt0(sdtasdt0(X0,X1)) = sdtasdt0(smndt0(X0),X1)
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) )
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f85,plain,
! [X0,X1] :
( ( smndt0(sdtasdt0(X0,X1)) = sdtasdt0(smndt0(X0),X1)
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) )
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f84]) ).
fof(f136,plain,
aScalar0(sz0z00),
inference(cnf_transformation,[],[f9]) ).
fof(f151,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f156,plain,
! [X0,X1] :
( smndt0(sdtasdt0(X0,X1)) = sdtasdt0(smndt0(X0),X1)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f209,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f213,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f216,plain,
xN = sdtasdt0(xR,xS),
inference(cnf_transformation,[],[f55]) ).
fof(f219,plain,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(cnf_transformation,[],[f65]) ).
cnf(c_56,plain,
aScalar0(sz0z00),
inference(cnf_transformation,[],[f136]) ).
cnf(c_68,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_75,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| sdtasdt0(smndt0(X0),X1) = smndt0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_130,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f209]) ).
cnf(c_134,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f213]) ).
cnf(c_135,plain,
sdtasdt0(xR,xS) = xN,
inference(cnf_transformation,[],[f216]) ).
cnf(c_139,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(cnf_transformation,[],[f219]) ).
cnf(c_1137,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(subtyping,[status(esa)],[c_139]) ).
cnf(c_1141,plain,
sdtasdt0(xR,xS) = xN,
inference(subtyping,[status(esa)],[c_135]) ).
cnf(c_1200,plain,
( ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| sdtasdt0(smndt0(X0_15),X1_15) = smndt0(sdtasdt0(X0_15,X1_15)) ),
inference(subtyping,[status(esa)],[c_75]) ).
cnf(c_1207,plain,
( ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| ~ aScalar0(X2_15)
| sdtasdt0(X0_15,X1_15) = sdtasdt0(X1_15,X0_15) ),
inference(subtyping,[status(esa)],[c_68]) ).
cnf(c_1225,plain,
( ~ aScalar0(X0_15)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_1207]) ).
cnf(c_1226,plain,
( ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| sdtasdt0(X0_15,X1_15) = sdtasdt0(X1_15,X0_15)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_1207]) ).
cnf(c_1227,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_1207]) ).
cnf(c_1236,plain,
( X0_15 != X1_15
| X2_15 != X1_15
| X2_15 = X0_15 ),
theory(equality) ).
cnf(c_1242,plain,
( X0_15 != X1_15
| smndt0(X0_15) = smndt0(X1_15) ),
theory(equality) ).
cnf(c_1290,plain,
( ~ aScalar0(sz0z00)
| ~ sP0_iProver_split ),
inference(instantiation,[status(thm)],[c_1225]) ).
cnf(c_1295,plain,
( sdtasdt0(X0_15,X1_15) = sdtasdt0(X1_15,X0_15)
| ~ aScalar0(X1_15)
| ~ aScalar0(X0_15) ),
inference(global_subsumption_just,[status(thm)],[c_1226,c_56,c_1290,c_1226,c_1227]) ).
cnf(c_1296,plain,
( ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| sdtasdt0(X0_15,X1_15) = sdtasdt0(X1_15,X0_15) ),
inference(renaming,[status(thm)],[c_1295]) ).
cnf(c_2529,plain,
( sdtasdt0(smndt0(xS),xR) != X0_15
| smndt0(xN) != X0_15 ),
inference(resolution,[status(thm)],[c_1236,c_1137]) ).
cnf(c_2533,plain,
( smndt0(xN) != smndt0(sdtasdt0(xS,xR))
| ~ aScalar0(xR)
| ~ aScalar0(xS) ),
inference(resolution,[status(thm)],[c_2529,c_1200]) ).
cnf(c_2534,plain,
smndt0(xN) != smndt0(sdtasdt0(xS,xR)),
inference(global_subsumption_just,[status(thm)],[c_2533,c_134,c_130,c_2533]) ).
cnf(c_2541,plain,
xN != sdtasdt0(xS,xR),
inference(resolution,[status(thm)],[c_2534,c_1242]) ).
cnf(c_2552,plain,
( sdtasdt0(xS,xR) != X0_15
| xN != X0_15 ),
inference(resolution,[status(thm)],[c_2541,c_1236]) ).
cnf(c_2602,plain,
( xN != sdtasdt0(xR,xS)
| ~ aScalar0(xR)
| ~ aScalar0(xS) ),
inference(resolution,[status(thm)],[c_1296,c_2552]) ).
cnf(c_2603,plain,
xN != sdtasdt0(xR,xS),
inference(global_subsumption_just,[status(thm)],[c_2602,c_134,c_130,c_2602]) ).
cnf(c_2608,plain,
( sdtasdt0(xR,xS) != X0_15
| xN != X0_15 ),
inference(resolution,[status(thm)],[c_2603,c_1236]) ).
cnf(c_2620,plain,
xN != xN,
inference(resolution,[status(thm)],[c_2608,c_1141]) ).
cnf(c_2621,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2620]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG059+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Sun Aug 27 02:02:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.03/1.21 % SZS status Started for theBenchmark.p
% 3.03/1.21 % SZS status Theorem for theBenchmark.p
% 3.03/1.21
% 3.03/1.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.03/1.21
% 3.03/1.21 ------ iProver source info
% 3.03/1.21
% 3.03/1.21 git: date: 2023-05-31 18:12:56 +0000
% 3.03/1.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.03/1.21 git: non_committed_changes: false
% 3.03/1.21 git: last_make_outside_of_git: false
% 3.03/1.21
% 3.03/1.21 ------ Parsing...
% 3.03/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.03/1.21
% 3.03/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.03/1.21
% 3.03/1.21 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.03/1.21
% 3.03/1.21 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 3.03/1.21 ------ Proving...
% 3.03/1.21 ------ Problem Properties
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21 clauses 93
% 3.03/1.21 conjectures 1
% 3.03/1.21 EPR 25
% 3.03/1.21 Horn 81
% 3.03/1.21 unary 40
% 3.03/1.21 binary 19
% 3.03/1.21 lits 227
% 3.03/1.21 lits eq 72
% 3.03/1.21 fd_pure 0
% 3.03/1.21 fd_pseudo 0
% 3.03/1.21 fd_cond 1
% 3.03/1.21 fd_pseudo_cond 5
% 3.03/1.21 AC symbols 0
% 3.03/1.21
% 3.03/1.21 ------ Input Options Time Limit: Unbounded
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21 ------
% 3.03/1.21 Current options:
% 3.03/1.21 ------
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21 ------ Proving...
% 3.03/1.21
% 3.03/1.21
% 3.03/1.21 % SZS status Theorem for theBenchmark.p
% 3.03/1.21
% 3.03/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.03/1.21
% 3.03/1.21
%------------------------------------------------------------------------------