TSTP Solution File: MGT041-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n024.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 22:10:36 EDT 2022
% Result : Unsatisfiable 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 07:29:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 8 Number of unprocessed: 8
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 8 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 1 conjectures.
% 0.19/0.36 # There are 1 start rule candidates:
% 0.19/0.36 # Found 4 unit axioms.
% 0.19/0.36 # 1 start rule tableaux created.
% 0.19/0.36 # 4 extension rule candidate clauses
% 0.19/0.36 # 4 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.36 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.19/0.36 # There were 0 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_12, hypothesis, (organisation_at_time(sk1,sk2))).
% 0.19/0.36 cnf(i_0_13, hypothesis, (founding_time(sk1,sk2))).
% 0.19/0.36 cnf(i_0_14, hypothesis, (number_of_routines(sk1,sk2,high))).
% 0.19/0.36 cnf(i_0_15, hypothesis, (~has_elaborated_routines(sk1,sk2))).
% 0.19/0.36 cnf(i_0_16, negated_conjecture, (first_mover(X1)|efficient_producer(X1)|~organisation_at_time(X1,X2))).
% 0.19/0.36 cnf(i_0_10, hypothesis, (has_elaborated_routines(X1,X2)|~founding_time(X1,X2)|~efficient_producer(X1)|~organisation_at_time(X1,X2))).
% 0.19/0.36 cnf(i_0_11, hypothesis, (number_of_routines(X1,X2,low)|~first_mover(X1)|~founding_time(X1,X2)|~organisation_at_time(X1,X2))).
% 0.19/0.36 cnf(i_0_9, plain, (~number_of_routines(X1,X2,low)|~number_of_routines(X1,X2,high))).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 11 steps
% 0.19/0.36 cnf(i_0_16, negated_conjecture, (first_mover(sk1)|efficient_producer(sk1)|~organisation_at_time(sk1,sk2)), inference(start_rule)).
% 0.19/0.36 cnf(i_0_19, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])).
% 0.19/0.36 cnf(i_0_17, plain, (first_mover(sk1)), inference(extension_rule, [i_0_11])).
% 0.19/0.36 cnf(i_0_26, plain, (~founding_time(sk1,sk2)), inference(closure_rule, [i_0_13])).
% 0.19/0.36 cnf(i_0_27, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])).
% 0.19/0.36 cnf(i_0_18, plain, (efficient_producer(sk1)), inference(extension_rule, [i_0_10])).
% 0.19/0.36 cnf(i_0_46, plain, (has_elaborated_routines(sk1,sk2)), inference(closure_rule, [i_0_15])).
% 0.19/0.36 cnf(i_0_47, plain, (~founding_time(sk1,sk2)), inference(closure_rule, [i_0_13])).
% 0.19/0.36 cnf(i_0_49, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])).
% 0.19/0.36 cnf(i_0_24, plain, (number_of_routines(sk1,sk2,low)), inference(extension_rule, [i_0_9])).
% 0.19/0.36 cnf(i_0_81, plain, (~number_of_routines(sk1,sk2,high)), inference(closure_rule, [i_0_14])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 1 tableaux to operate on
% 0.19/0.36 # Found closed tableau during pool population.
% 0.19/0.36 # Proof search is over...
% 0.19/0.36 # Freeing feature tree
%------------------------------------------------------------------------------