TSTP Solution File: CSR054+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR054+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 : 600s
% DateTime : Fri Jul 15 02:47:05 EDT 2022
% Result : Theorem 7.76s 2.39s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 2 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),f_tptpquantityfn_21(n_170))
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jli292lc/lgb.p',i_0_1) ).
cnf(i_0_41,negated_conjecture,
mtvisible(c_currentworlddatacollectormt_nonhomocentric),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jli292lc/lgb.p',i_0_41) ).
cnf(i_0_40,negated_conjecture,
~ tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jli292lc/lgb.p',i_0_40) ).
cnf(c_0_45,plain,
( tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),f_tptpquantityfn_21(n_170))
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
i_0_1 ).
cnf(c_0_46,negated_conjecture,
mtvisible(c_currentworlddatacollectormt_nonhomocentric),
i_0_41 ).
cnf(c_0_47,negated_conjecture,
~ tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),X1),
i_0_40 ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : CSR054+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 10:58:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.76/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.39 # No SInE strategy applied
% 7.76/2.39 # Trying AutoSched0 for 150 seconds
% 7.76/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S043N
% 7.76/2.39 # and selection function PSelectMaxLComplexNoTypePred.
% 7.76/2.39 #
% 7.76/2.39 # Preprocessing time : 0.022 s
% 7.76/2.39 # Presaturation interreduction done
% 7.76/2.39
% 7.76/2.39 # Proof found!
% 7.76/2.39 # SZS status Theorem
% 7.76/2.39 # SZS output start CNFRefutation
% See solution above
% 7.76/2.39 # Training examples: 0 positive, 0 negative
% 7.76/2.39
% 7.76/2.39 # -------------------------------------------------
% 7.76/2.39 # User time : 0.024 s
% 7.76/2.39 # System time : 0.004 s
% 7.76/2.39 # Total time : 0.028 s
% 7.76/2.39 # Maximum resident set size: 7124 pages
% 7.76/2.39
%------------------------------------------------------------------------------