%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SEU167+3 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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 May 7 07:33:50 PM UTC 2026
% Result : Theorem 0.48s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU167+3 : TPTP v9.2.1. Released v3.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Thu May 7 13:10:15 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 SPASS-SCL-FOL version:
% 0.18/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.48/0.57 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57 Execution resolution_3 ended with status: unsatisfiable
% 0.48/0.57 Used heuristic: resolution_3
% 0.48/0.57
% 0.48/0.57 Input Clauses:
% 0.48/0.57
% 0.48/0.57 Predicates: empty subset ren1
% 0.48/0.57 Fol Constants: skc1 skc2 skc3 skc4 skc5 skc6
% 0.48/0.57 Fol Functions: cartesian_product2
% 0.48/0.57 Problem Properties:
% 0.48/0.57 This is a full first-order problem without equality.
% 0.48/0.57
% 0.48/0.57 After reduction: Problem Properties:
% 0.48/0.57 This is a full first-order problem without equality.
% 0.48/0.57
% 0.48/0.57
% 0.48/0.57 Reduced Input Clauses:
% 0.48/0.57
% 0.48/0.57 Most General Atoms: empty(skc1) empty(skc2) ren1(x0,x2,x1) subset(x0,x2)
% 0.48/0.57
% 0.48/0.57 === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially, heuristics mode: resolution_3 ===
% 0.48/0.57
% 0.48/0.57 === Backtracking. Learning clause 11:2:1:[10.2,7.1]:Top: subset(x0,skc3) -> subset(x0,skc4)
% 0.48/0.57 === Backtracking. Learning clause 12:2:1:[10.2,8.1]:Top: subset(x0,skc5) -> subset(x0,skc6)
% 0.48/0.57 === Backtracking. Learning clause 13:2:1:[10.3,9.1]:Top: subset(cartesian_product2(skc3,skc5),x0),subset(x0,cartesian_product2(skc4,skc6)) ->
% 0.48/0.57 === Clause set with instances from active satisfied. Growing active. New size: 30
% 0.48/0.57 === Restarting.
% 0.48/0.57 === Backtracking. Learning clause 14:3:2:[10.3,13.1]:TopTop: subset(cartesian_product2(skc3,skc5),x0),subset(x0,x1),subset(x1,cartesian_product2(skc4,skc6)) ->
% 0.48/0.57 === Conflict found: 13:2:1:[10.3,9.1]:Top: subset(cartesian_product2(skc3,skc5),x0),subset(x0,cartesian_product2(skc4,skc6)) -> {x0 -> cartesian_product2(skc1,skc5)}
% 0.48/0.57 === Backtracking. Learning clause 15:2:1:[13.1,4.2]:Top: subset(cartesian_product2(x0,skc5),cartesian_product2(skc4,skc6)),ren1(skc3,skc5,x0) ->
% 0.48/0.57 === Conflict found: 13:2:1:[10.3,9.1]:Top: subset(cartesian_product2(skc3,skc5),x0),subset(x0,cartesian_product2(skc4,skc6)) -> {x0 -> cartesian_product2(skc3,skc1)}
% 0.48/0.57 === Backtracking. Learning clause 16:2:1:[13.1,5.2]:Top: subset(cartesian_product2(skc3,x0),cartesian_product2(skc4,skc6)),ren1(skc5,skc3,x0) ->
% 0.48/0.57 === Backtracking. Learning clause 17:2:1:[10.2,5.2,9.1]:Top: subset(cartesian_product2(skc3,skc5),cartesian_product2(skc4,x0)),ren1(x0,skc4,skc6) ->
% 0.48/0.57 === Clause set with instances from active satisfied. Growing active. New size: 46
% 0.48/0.57 === Restarting.
% 0.48/0.57 === Backtracking. Learning clause 18:3:2:[10.3,15.1]:TopTop: subset(cartesian_product2(x0,skc5),x1),subset(x1,cartesian_product2(skc4,skc6)),ren1(skc3,skc5,x0) ->
% 0.48/0.57 === Backtracking. Learning clause 19:3:2:[10.3,16.1]:TopTop: subset(cartesian_product2(skc3,x0),x1),subset(x1,cartesian_product2(skc4,skc6)),ren1(skc5,skc3,x0) ->
% 0.48/0.57 === Conflict found: 17:2:1:[10.2,5.2,9.1]:Top: subset(cartesian_product2(skc3,skc5),cartesian_product2(skc4,x0)),ren1(x0,skc4,skc6) -> {x0 -> skc5}
% 0.48/0.57
% 0.48/0.57 SZS status Unsatisfiable
% 0.48/0.57
% 0.48/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57
% 0.48/0.57 SPASS-SCL-FOL Statistics:
% 0.48/0.57 Number of learned clauses: 9
% 0.48/0.57 Number of propagations: 116
% 0.48/0.57 Number of decisions: 62
% 0.48/0.57 Number of resolutions: 15
% 0.48/0.57 Number of condensations: 0
% 0.48/0.57 Number of sub resolutions: 0
% 0.48/0.57 Number of input literals (deduplicated): 10
% 0.48/0.57 Number of grows: 2
% 0.48/0.57 Number of considered ground atoms: 46
% 0.48/0.57
% 0.48/0.57 Needed: 0:00:00.01
% 0.48/0.57
%------------------------------------------------------------------------------