%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : COM011-2 : 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 : n016.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:19:10 PM UTC 2026
% Result : Unsatisfiable 0.46s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM011-2 : 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.17/0.34 % Computer : n016.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 11:36:07 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.46/0.57 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57 Execution resolution_1 ended with status: unsatisfiable
% 0.46/0.57 Used heuristic: resolution_1
% 0.46/0.57
% 0.46/0.57 Input Clauses:
% 0.46/0.57
% 0.46/0.57 Predicates: c_in c_lessequals
% 0.46/0.57 Fol Constants: v_F v_A v_B t_a
% 0.46/0.57 Fol Functions: c_union c_UNITY_Oconstrains tc_UNITY_Oprogram c_WFair_Otransient c_WFair_OleadsTo tc_set c_minus c_Main_OsubsetI__1 c_WFair_Oensures
% 0.46/0.57 Problem Properties:
% 0.46/0.57 This is a full first-order problem without equality.
% 0.46/0.57
% 0.46/0.57 After reduction: Problem Properties:
% 0.46/0.57 This is a full first-order problem without equality.
% 0.46/0.57
% 0.46/0.57
% 0.46/0.57 Reduced Input Clauses:
% 0.46/0.57
% 0.46/0.57 Most General Atoms: c_in(x0,x1,x3) c_lessequals(x3,x1,tc_set(x2))
% 0.46/0.57
% 0.46/0.57 === Starting SPASS-SCL-FOL A Little Less Naive, considering 29 atoms initially, heuristics mode: resolution_1 ===
% 0.46/0.57
% 0.46/0.57 === Backtracking. Learning clause 11:2:1:[10.1,2.1]:Top: c_lessequals(x0,v_A,tc_set(t_a)) -> c_in(v_F,c_WFair_Otransient(x0,t_a),tc_UNITY_Oprogram(t_a))
% 0.46/0.57 === Backtracking. Learning clause 12:1:2:[5.1,6.1]:TopTop: -> c_lessequals(x0,x0,tc_set(x1))
% 0.46/0.57 === Backtracking. Learning clause 13:2:1:[7.1,1.1]:Top: c_lessequals(x0,v_A,tc_set(t_a)) -> c_in(v_F,c_UNITY_Oconstrains(x0,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
% 0.46/0.57 === Backtracking. Learning clause 14:2:4:[9.1,5.1]:TopTopTopTop: -> c_in(c_Main_OsubsetI__1(c_WFair_Oensures(x0,x1,x2),x3,tc_UNITY_Oprogram(x2)),c_WFair_OleadsTo(x0,x1,x2),tc_UNITY_Oprogram(x2)),c_lessequals(c_WFair_Oensures(x0,x1,x2),x3,tc_set(tc_UNITY_Oprogram(x2)))
% 0.46/0.57 === Backtracking. Learning clause 15:1:3:[4.1,5.1,6.1]:TopTopTop: -> c_lessequals(c_minus(x0,x1,tc_set(x2)),x0,tc_set(x2))
% 0.46/0.57 === Backtracking. Learning clause 16:4:5:[8.1,7.3]:TopTopTopTopTop: c_in(x0,c_WFair_Otransient(c_minus(x1,x2,tc_set(x3)),x3),tc_UNITY_Oprogram(x3)),c_in(x0,c_UNITY_Oconstrains(x4,c_union(x1,x2,x3),x3),tc_UNITY_Oprogram(x3)),c_lessequals(c_minus(x1,x2,tc_set(x3)),x4,tc_set(x3)) -> c_in(x0,c_WFair_Oensures(x1,x2,x3),tc_UNITY_Oprogram(x3))
% 0.46/0.57 === Backtracking. Learning clause 17:3:4:[8.1,5.1]:TopTopTopTop: c_in(c_Main_OsubsetI__1(c_UNITY_Oconstrains(c_minus(x0,x1,tc_set(x2)),c_union(x0,x1,x2),x2),x3,tc_UNITY_Oprogram(x2)),c_WFair_Otransient(c_minus(x0,x1,tc_set(x2)),x2),tc_UNITY_Oprogram(x2)) -> c_in(c_Main_OsubsetI__1(c_UNITY_Oconstrains(c_minus(x0,x1,tc_set(x2)),c_union(x0,x1,x2),x2),x3,tc_UNITY_Oprogram(x2)),c_WFair_Oensures(x0,x1,x2),tc_UNITY_Oprogram(x2)),c_lessequals(c_UNITY_Oconstrains(c_minus(x0,x1,tc_set(x2)),c_union(x0,x1,x2),x2),x3,tc_set(tc_UNITY_Oprogram(x2)))
% 0.46/0.57 === Clause set with instances from active satisfied. Growing active. New size: 47
% 0.46/0.57 === Restarting.
% 0.46/0.57 === Clause set with instances from active satisfied. Growing active. New size: 111
% 0.46/0.57 === Backtracking. Learning clause 18:1:0:[9.2,3.1]:: c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ->
% 0.46/0.57 === Conflict found: 11:2:1:[10.1,2.1]:Top: c_lessequals(x0,v_A,tc_set(t_a)) -> c_in(v_F,c_WFair_Otransient(x0,t_a),tc_UNITY_Oprogram(t_a)) {x0 -> c_minus(v_A,v_B,tc_set(t_a))}
% 0.46/0.57
% 0.46/0.57 SZS status Unsatisfiable
% 0.46/0.57
% 0.46/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.57
% 0.46/0.57 SPASS-SCL-FOL Statistics:
% 0.46/0.57 Number of learned clauses: 8
% 0.46/0.57 Number of propagations: 103
% 0.46/0.57 Number of decisions: 74
% 0.46/0.57 Number of resolutions: 13
% 0.46/0.57 Number of condensations: 0
% 0.46/0.57 Number of sub resolutions: 0
% 0.46/0.57 Number of input literals (deduplicated): 14
% 0.46/0.57 Number of grows: 2
% 0.46/0.57 Number of considered ground atoms: 111
% 0.46/0.57
% 0.46/0.57 Needed: 0:00:00.01
% 0.46/0.57
%------------------------------------------------------------------------------