TSTP Solution File: LAT270-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LAT270-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:34:58 EDT 2024
% Result : Unsatisfiable 1.52s 1.19s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
c_in(v_a,v_A,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_50,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_51,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_52,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(c_53,plain,
( ~ c_lessequals(X0,c_Tarski_Ointerval(v_r,X1,X2,t_a),tc_set(t_a))
| ~ c_in(X1,v_A,t_a)
| ~ c_in(X2,v_A,t_a)
| c_lessequals(X0,v_A,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0) ).
cnf(c_71,plain,
tc_set(t_a) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
c_Tarski_Ointerval(v_r,v_a,v_b,t_a) = sP1_iProver_def,
definition ).
cnf(c_73,negated_conjecture,
~ c_lessequals(v_S,v_A,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_52,c_71]) ).
cnf(c_74,negated_conjecture,
c_lessequals(v_S,sP1_iProver_def,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_51,c_72]) ).
cnf(c_75,negated_conjecture,
c_in(v_b,v_A,t_a),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_76,negated_conjecture,
c_in(v_a,v_A,t_a),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_214,plain,
( ~ c_lessequals(X0,c_Tarski_Ointerval(v_r,X1,X2,t_a),sP0_iProver_def)
| ~ c_in(X1,v_A,t_a)
| ~ c_in(X2,v_A,t_a)
| c_lessequals(X0,v_A,sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_53,c_71]) ).
cnf(c_219,plain,
( ~ c_lessequals(X0,sP1_iProver_def,sP0_iProver_def)
| ~ c_in(v_a,v_A,t_a)
| ~ c_in(v_b,v_A,t_a)
| c_lessequals(X0,v_A,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_72,c_214]) ).
cnf(c_220,plain,
( ~ c_lessequals(X0,sP1_iProver_def,sP0_iProver_def)
| c_lessequals(X0,v_A,sP0_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_219,c_75,c_76]) ).
cnf(c_228,plain,
c_lessequals(v_S,v_A,sP0_iProver_def),
inference(superposition,[status(thm)],[c_74,c_220]) ).
cnf(c_229,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_228,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT270-2 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n021.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 : Thu May 2 18:07:27 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/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
% 1.52/1.19 % SZS status Started for theBenchmark.p
% 1.52/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.52/1.19
% 1.52/1.19 ------ iProver source info
% 1.52/1.19
% 1.52/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.52/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.52/1.19 git: non_committed_changes: false
% 1.52/1.19
% 1.52/1.19 ------ Parsing...successful
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.52/1.19 ------ Proving...
% 1.52/1.19 ------ Problem Properties
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 clauses 7
% 1.52/1.19 conjectures 4
% 1.52/1.19 EPR 4
% 1.52/1.19 Horn 7
% 1.52/1.19 unary 6
% 1.52/1.19 binary 0
% 1.52/1.19 lits 10
% 1.52/1.19 lits eq 2
% 1.52/1.19 fd_pure 0
% 1.52/1.19 fd_pseudo 0
% 1.52/1.19 fd_cond 0
% 1.52/1.19 fd_pseudo_cond 0
% 1.52/1.19 AC symbols 0
% 1.52/1.19
% 1.52/1.19 ------ Schedule dynamic 5 is on
% 1.52/1.19
% 1.52/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------
% 1.52/1.19 Current options:
% 1.52/1.19 ------
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Proving...
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.19
% 1.52/1.19
%------------------------------------------------------------------------------