TSTP Solution File: LCL407-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL407-2 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% 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 : Sun Jul 17 09:43:07 EDT 2022
% Result : Unknown 0.79s 1.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL407-2 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n011.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 : 600
% 0.12/0.34 % DateTime : Mon Jul 4 08:17:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.79/1.17 ----- EQP 0.9e, May 2009 -----
% 0.79/1.17 The job began on n011.cluster.edu, Mon Jul 4 08:17:22 2022
% 0.79/1.17 The command was "./eqp09e".
% 0.79/1.17
% 0.79/1.17 set(prolog_style_variables).
% 0.79/1.17 set(lrpo).
% 0.79/1.17 set(basic_paramod).
% 0.79/1.17 set(functional_subsume).
% 0.79/1.17 set(ordered_paramod).
% 0.79/1.17 set(prime_paramod).
% 0.79/1.17 set(para_pairs).
% 0.79/1.17 assign(pick_given_ratio,4).
% 0.79/1.17 clear(print_kept).
% 0.79/1.17 clear(print_new_demod).
% 0.79/1.17 clear(print_back_demod).
% 0.79/1.17 clear(print_given).
% 0.79/1.17 assign(max_mem,64000).
% 0.79/1.17 end_of_commands.
% 0.79/1.17
% 0.79/1.17 Usable:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Sos:
% 0.79/1.17 0 (wt=-1) [] not(A) = xor(A,truth).
% 0.79/1.17 0 (wt=-1) [] xor(A,falsehood) = A.
% 0.79/1.17 0 (wt=-1) [] xor(A,A) = falsehood.
% 0.79/1.17 0 (wt=-1) [] and_star(A,truth) = A.
% 0.79/1.17 0 (wt=-1) [] and_star(A,falsehood) = falsehood.
% 0.79/1.17 0 (wt=-1) [] and_star(xor(truth,A),A) = falsehood.
% 0.79/1.17 0 (wt=-1) [] xor(A,xor(truth,B)) = xor(xor(A,truth),B).
% 0.79/1.17 0 (wt=-1) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Demodulators:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Passive:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Starting to process input.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 1 (wt=6) [] not(A) = xor(A,truth).
% 0.79/1.17 1 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 2 (wt=5) [] xor(A,falsehood) = A.
% 0.79/1.17 2 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 3 (wt=5) [] xor(A,A) = falsehood.
% 0.79/1.17 3 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 4 (wt=5) [] and_star(A,truth) = A.
% 0.79/1.17 4 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.79/1.17 5 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.79/1.17 6 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.79/1.17 7 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 8 (wt=19) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.79/1.17 clause forward subsumed: 0 (wt=19) [flip(8)] and_star(xor(and_star(xor(truth,B),A),truth),A) = and_star(xor(and_star(xor(truth,A),B),truth),B).
% 0.79/1.17
% 0.79/1.17 no more inferences to make.
% 0.79/1.17
% 0.79/1.17 After processing input:
% 0.79/1.17
% 0.79/1.17 Usable:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Sos:
% 0.79/1.17 2 (wt=5) [] xor(A,falsehood) = A.
% 0.79/1.17 3 (wt=5) [] xor(A,A) = falsehood.
% 0.79/1.17 4 (wt=5) [] and_star(A,truth) = A.
% 0.79/1.17 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.79/1.17 1 (wt=6) [] not(A) = xor(A,truth).
% 0.79/1.17 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.79/1.17 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.79/1.17 8 (wt=19) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Demodulators:
% 0.79/1.17 1 (wt=6) [] not(A) = xor(A,truth).
% 0.79/1.17 2 (wt=5) [] xor(A,falsehood) = A.
% 0.79/1.17 3 (wt=5) [] xor(A,A) = falsehood.
% 0.79/1.17 4 (wt=5) [] and_star(A,truth) = A.
% 0.79/1.17 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.79/1.17 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.79/1.17 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Passive:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 no more inferences to make.
% 0.79/1.17
% 0.79/1.17 ------------- memory usage ------------
% 0.79/1.17 Memory dynamically allocated (tp_alloc): 488.
% 0.79/1.17 type (bytes each) gets frees in use avail bytes
% 0.79/1.17 sym_ent ( 96) 54 0 54 0 5.1 K
% 0.79/1.17 term ( 16) 4696 4207 489 37 10.1 K
% 0.79/1.17 gen_ptr ( 8) 2923 1009 1914 31 15.2 K
% 0.79/1.17 context ( 808) 8691 8691 0 5 3.9 K
% 0.79/1.17 trail ( 12) 43 43 0 2 0.0 K
% 0.79/1.17 bt_node ( 68) 5196 5196 0 13 0.9 K
% 0.79/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_free_vars_pos (4020)
% 0.79/1.17 0 0 0 0 0.0 K
% 0.79/1.17 discrim ( 12) 397 34 363 20 4.5 K
% 0.79/1.17 flat ( 40) 8113 8113 0 27 1.1 K
% 0.79/1.17 discrim_pos ( 12) 328 328 0 1 0.0 K
% 0.79/1.17 fpa_head ( 12) 184 0 184 0 2.2 K
% 0.79/1.17 fpa_tree ( 28) 79 79 0 7 0.2 K
% 0.79/1.17 fpa_pos ( 36) 59 59 0 1 0.0 K
% 0.79/1.17 literal ( 12) 219 185 34 2 0.4 K
% 0.79/1.17 clause ( 24) 219 185 34 2 0.8 K
% 0.79/1.17 list ( 12) 84 28 56 3 0.7 K
% 0.79/1.17 list_pos ( 20) 145 28 117 9 2.5 K
% 0.79/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.17
% 0.79/1.17 -------------- statistics -------------
% 0.79/1.17 Clauses input 8
% 0.79/1.17 Usable input 0
% 0.79/1.17 Sos input 8
% 0.79/1.17 Demodulators input 0
% 0.79/1.17 Passive input 0
% 0.79/1.17
% 0.79/1.17 Processed BS (before search) 9
% 0.79/1.17 Forward subsumed BS 1
% 0.79/1.17 Kept BS 8
% 0.79/1.17 New demodulators BS 7
% 0.79/1.17 Back demodulated BS 0
% 0.79/1.17
% 0.79/1.17 Clauses or pairs given 466
% 0.79/1.17 Clauses generated 154
% 0.79/1.17 Forward subsumed 128
% 0.79/1.17 Deleted by weight 0
% 0.79/1.17 Deleted by variable count 0
% 0.79/1.17 Kept 26
% 0.79/1.17 New demodulators 18
% 0.79/1.17 Back demodulated 5
% 0.79/1.17 Ordered paramod prunes 0
% 0.79/1.17 Basic paramod prunes 1559
% 0.79/1.17 Prime paramod prunes 34
% 0.79/1.17 Semantic prunes 0
% 0.79/1.17
% 0.79/1.17 Rewrite attmepts 2397
% 0.79/1.17 Rewrites 274
% 0.79/1.17
% 0.79/1.17 FPA overloads 0
% 0.79/1.17 FPA underloads 0
% 0.79/1.17
% 0.79/1.17 Usable size 0
% 0.79/1.17 Sos size 29
% 0.79/1.17 Demodulators size 25
% 0.79/1.17 Passive size 0
% 0.79/1.17 Disabled size 5
% 0.79/1.17
% 0.79/1.17 Proofs found 0
% 0.79/1.17
% 0.79/1.17 ----------- times (seconds) ----------- Mon Jul 4 08:17:22 2022
% 0.79/1.17
% 0.79/1.17 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.79/1.17 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.79/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.17 input time 0.00
% 0.79/1.17 paramodulation time 0.00
% 0.79/1.17 demodulation time 0.00
% 0.79/1.17 orient time 0.00
% 0.79/1.17 weigh time 0.00
% 0.79/1.17 forward subsume time 0.00
% 0.79/1.17 back demod find time 0.00
% 0.79/1.17 conflict time 0.00
% 0.79/1.17 LRPO time 0.00
% 0.79/1.17 store clause time 0.00
% 0.79/1.17 disable clause time 0.00
% 0.79/1.17 prime paramod time 0.00
% 0.79/1.17 semantics time 0.00
% 0.79/1.17
% 0.79/1.17 EQP interrupted
%------------------------------------------------------------------------------